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
50
51
52
53
54
55
#include <iostream>
#include <map>
#include <unordered_map>
#include <vector>
#include <unordered_set>
#include <set>
#include <queue>
#include <utility>
#include <algorithm>
#include <cassert>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
typedef vector<ll> vi;


const int S = 1e6 + 7;
const int mod = 1e9 + 7;
int tab[S], n, m;

// inject here

void solve(){
    cin >> n;
    int sum = 0, s;
    for (int i = 1; sum < n; i ++){
        sum += __builtin_popcount(i);
        s = i;
    }
    int rest = sum - n;
   // cout << s << " " << rest << endl;
    vector<int> res;
    for (int i = s; i >= 1; i --){
        if (rest == __builtin_popcount(i)){
            rest -= __builtin_popcount(i);
            continue;
        }
        res.push_back(i);
    }
    cout << res.size() << "\n";
    for (auto e : res) cout << e << " ";
    cout << endl;
}


int main(){
    ios_base::sync_with_stdio(0);
    int t = 1;
   // cin >> t;
    while (t --)
        solve();

    return 0;
}