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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
// Karol Kosinski 2022
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b);i<_b;++i)
#define FR_(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FD_(i,b,a) for(int i=(b),_a=(a);i>=_a;--i)
#define ALL(c) (c).begin(),(c).end()
#define SIZE(c) int((c).size())
#define TIE(x...) int x;tie(x)
#define X first
#define Y second
#ifndef ENABLE_DEBUG
#define DEB(k,p,f,x...)
#else
#define DEB(k,p,f,x...) {if(k)printf("--------%4d : %s\n",__LINE__,__FUNCTION__);if(p)f(x);}
#endif
#define DEBL DEB(1,1,void,0)
#define DEBF(f,x...) DEB(1,1,f,x)
#define DEBC(p,x...) DEB(0,p,printf,x)
#define DEBUG(x...) DEB(0,1,printf,x)
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using TIII = tuple<int, int, int>;

constexpr int NX = 1'000'005;

int M[NX], Bit[NX];

int main()
{
    Bit[1] = 1;
    FOR(i,2,NX)
    {
        Bit[i] = Bit[ i >> 1 ] + ( i & 1 );
    }
    int n;
    scanf("%d", &n);
    M[1] = 1;
    FR_(i,2,n)
    {
        int b = Bit[ M[ i - 1 ] ];
        if ( M[ i - b ] < M[ i - 1 ] )
        {
            M[i] = M[ i - 1 ];
        }
        else
        {
            M[i] = M[ i - 1 ] + 1;
        }
    }
    vector<int> Res;
    int start = n;
    while ( M[start] > 0 )
    {
        int b = M[start];
        Res.push_back(b);
        start -= Bit[b];
    }
    printf("%d\n", SIZE(Res));
    for ( int r : Res ) printf("%d ", r);
    printf("\n");
    return 0;
}