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
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace __gnu_pbds;
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 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 long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937_64 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

const int N = 1e6+5;
int sum[N];

int main() {
	int n;
	scanf("%d", &n);

	for (int i = 1; i < N; ++i)
		sum[i] += sum[i - 1] + __builtin_popcount(i);

	int p = lower_bound(sum, sum + N, n) - sum;
	if (sum[p] == n) printf("%d\n", p);
	else printf("%d\n", p - 1);
	for (int i = p; i >= 1; --i) {
		if (sum[p] - n == __builtin_popcount(i)) sum[p] -= __builtin_popcount(i);
		else printf("%d ", i);
	}
	puts("");
}