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
#include<bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
using vpi = vector<pi>;
#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define ALLD(c) (c).rbegin(), (c).rend()
#define SIZE(x) ((int)(x).size())
#define pb push_back
#define pp emplace_back
#define st first
#define nd second
#define sq(a) (a)*(a)
const int inf = 1000000001;
const double eps = 1e-9;
bool fleq(double a, double b){
	return abs(a - b) < eps;
}

int n, m;
int s[125000];
vector<int>ans;
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for(int i = 1; i < 125000; i++){
		m += __builtin_popcount(i);
		s[i] = m;
	}
	while(n > 0){
		int f = lower_bound(s, s + 124999, n) - s;
		ans.pb(f);
		n -= __builtin_popcount(f);
	}
	cout << SIZE(ans) << '\n';
	for(int i : ans)cout << i << ' ';		
	return 0;
}