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
#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i = (a); i <= (b); ++i)
#define FORD(i,a,b) for(int i = (a); i >= (b); --i)
#define RI(i,n) FOR(i,1,(n))
#define REP(i,n) FOR(i,0,(n)-1)
#define mini(a,b) a=min(a,b)
#define maxi(a,b) a=max(a,b)
#define pb push_back
#define st first
#define nd second
#define sz(w) (int) w.size()
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pii, int> para;
const ll inf = 1e18 + 7;
const ll maxN = 1e6 + 5;
const ll MOD = 1e9 + 7;


int main() {
    int n; cin >> n;
    int sum = 0;
    int skip = 0, end = -1;
    for (int i = 1; i <= n; i++) {
        sum += __builtin_popcount(i);
        if (sum >= n) {
            end = i;
            if (sum > n) {
                for (int j = i; j >= 1; j--) {
                    if (__builtin_popcount(j) == sum - n) {
                        skip = j;
                        break;
                    }
                }
            }
            break;
        }
    }
    cout << end - (skip != 0) << "\n";
    FORD(i, end, 1) {
        if (i == skip) continue;
        cout << i << " ";
    }
    cout << endl;
    return 0;
}