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
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define REPD(i,a,b) for (int i = (a); i >= (b); --i)
#define FORI(i,n) REP(i,1,n)
#define FOR(i,n) REP(i,0,int(n)-1)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
#define SZ(x) int((x).size())
#define DBG(v) cerr << #v << " = " << (v) << endl;
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define fi first
#define se second

int main() {
	int n;
	scanf("%d", &n);
	int x = 0, tot = 0;
	while (tot < n) {
		x++;
		tot += __builtin_popcount(x);
	}
	vi rmv;
	for (int i = x; i >= 1; i--) {
		int cur = __builtin_popcount(i);
		if (tot-cur >= n) {
			tot -= cur;
			rmv.pb(i);
		}
	}
	int m = SZ(rmv), c = m-1;
	printf("%d\n", x-m);
	for (int i = x; i >= 1; i--) {
		if (c>=0 && rmv[c]==i) {}
		else printf("%d ", i);
	}
	printf("\n");
	return 0;
}