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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
/* -----------------------
Autor: Tomasz Boguslawski
-------------------------- */
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<fstream>
#include<iomanip>
#include<string>
#include<sstream>
#include<cstring>
#include<map>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include <fstream>
#include<math.h>

#define LL long long
#define FOR(x, b, e) for(LL x = b; x <= (e); x++)
#define FORS(x, b, e, s) for(LL x = b; x <= (e); x+=s)
#define FORD(x, b, e) for(LL x = b; x >= (e); x--)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG if (debug)
#define MIN(a,b) ((a>b)?b:a)
#define MAX(a,b) ((a>b)?a:b)

using namespace std;

LL f[1000007];

LL bitCount(LL num)
{
    LL count=0;
    while (num>0)
    {
        if (num%2==1) count++;
        num = num / 2;
    }
    return count;
}

void count_f()
{
    f[1]=1;
    FOR(k,2,1000000)
    {
        FOR(j,f[k-1],1000000)
        {
            // check if j could be first element of sequence for k
            LL c = bitCount(j);
            LL bitsLeft=k-c;
            if (bitsLeft<0) continue; // bad
            if ((bitsLeft==0)||(f[bitsLeft]<j)) { f[k]=j; break; };
        }
        //cout << k << ": " << f[k] << "\n"; cout.flush();
        //if (f[k]<f[k-1]) { cout << "!!! " << k << "\n"; break; };
    }
}

/// MAIN
int main(int argc, char* argv[])
{
    // magic formula, which makes streams work faster:
	ios_base::sync_with_stdio(0);
	count_f();
	LL n;
	cin >> n;
	vector<LL> seq;
	LL elem;
	while (n>0)
    {
        elem = f[n];
        seq.push_back(elem);
        n -= bitCount(elem);
    }
    cout << seq.size() << "\n";
    FOREACH(ep,seq) cout << *ep << ' ';
    cout << "\n";
	return 0;
}