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
56
57
58
59
60
61
62
63
64
65
66
#include <bits/stdc++.h>
using namespace std;

#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define ST first
#define ND second
#define MP make_pair
#define PB push_back

typedef vector<int> VI;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef set<int> SI;
typedef long long LL;

#ifdef DEBUG
const bool debug = true;
#else
const bool debug = false;
#endif
int N, M, k, l;

const int inf = 1000 * 1000 * 1000;
const int MAKSN = 1000 * 1000 + 13;
const LL MOD = 123456789LL;

void readIn() {
    cin >> N;
}

void solve() {
    int i = 0;
    int sum = 0;
    while (i < N && sum < N) {
        i++;
        sum += __builtin_popcount(i);
    }

    vector<int> res;
    while (i > 0 && N > 0) {
        int cur = __builtin_popcount(i);
        if (sum - cur < N) {
            N -= cur;
            res.push_back(i);
        }

        sum -= cur;
        i--;
    }

    cout << res.size() << "\n";
    for (auto k : res) {
        cout << k << " ";
    }
    cout << "\n";
}

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

    readIn();
    solve();
    return 0;
}