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>
#define st first
#define nd second
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

const int MN = 1e6 + 5LL;
int tab[MN];
vector<int>res;

int tobin(int x)
{
    int ile = 0;
    while(x)
    {
        ile += (x&1);
        x >>= 1;
    }
    return ile;
}

int binsearch(int val)
{
    int l = 1, r = MN-1;
    while(l < r)
    {
        int mid = (l+r)>>1;
        if(tab[mid] >= val) r = mid;
        else l = mid + 1;
    }
    return l;
}

int main()
{
    BOOST;
    int n;
    cin>>n;
    for(int i = 1; i < MN; i++) tab[i] = tobin(i);
    for(int i = 2; i < MN; i++) tab[i] += tab[i-1];
    while(n)
    {
        int ans = binsearch(n);
        res.push_back(ans);
        n -= (tab[ans]-tab[ans-1]);
    }
    cout<<res.size()<<'\n';
    for(int i = 0; i < res.size(); i++) cout<<res[i]<<' ';
    return 0;
}