1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include <bits/stdc++.h>
#include <random>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
#define ld long double
#define ull unsigned long long
#define mt make_tuple

using namespace std;

const int nax = 5e5 + 5;
int cnt[nax];
vector<int> ans;
void reku(int fi, int bitsum){
    if(bitsum == 0) return;
    if(cnt[fi - 1] >= bitsum){
        reku(fi - 1, bitsum);
        return;
    }
    int cost = __builtin_popcount(fi);
    ans.pb(fi);
    reku(fi - 1, bitsum - cost);
}

void solve(){
    int n; cin >> n;
    for(int i=1;i<nax;i++){
        cnt[i] = (cnt[i - 1] + __builtin_popcount(i));
    }
    reku(nax - 1, n);
    cout << ans.size() << "\n";
    for(int x : ans) cout << x << " ";
    cout << "\n";
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

    return 0;
}