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
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(1); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

int n;
int main() {
	scanf("%d",&n);
	int x=0;
	for (int i=1;i<=n;i++) {
		x+=__builtin_popcount(i);
		if (x==n) {
			printf("%d\n",i);
			per(j,1,i+1) printf("%d ",j);
			puts("");
			break;
		} else if (x>n) {
			printf("%d\n",i-1);
			bool mis=0;
			per(j,1,i+1) {
				if (!mis&&__builtin_popcount(j)==x-n) {
					mis=1;
					continue;
				}
				printf("%d ",j);
			}
			puts("");
			break;
		}
	}
}