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
#include <bits/stdc++.h>
#define ft first
#define sc second
#define pb push_back
#define FOR(i,n) for(int i=0; i<n; i++)
#define watch(x) cout << (#x) << " == " << (x) << endl
typedef long long ll;
typedef long double ld;
using namespace std;
const ll N=120206;
int bity[N+5];
vector<int> ans;

int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);

bity[0]=0;
for (int i=1; i<=N; i++){
  bity[i] = bity[i-1] + __builtin_popcount(i);
}

ll n;
cin>>n;

for (int i=upper_bound(bity, bity+N+1, n)-bity; n>0; i--){
  if (bity[i]>=n && n>bity[i-1]){
    ans.pb(i);
    n-=__builtin_popcount(i);
  }
}

cout<<ans.size()<<"\n";
for (int a : ans){
  cout<<a<<" ";
}

return 0;
}