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
#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

template<typename _T> inline void _DBG(const char *s, _T x) { cerr << s << " = " << x << "\n"; }
template<typename _T, typename... args> void _DBG(const char *s, _T x, args... a) { while(*s != ',') cerr << *s++; cerr << " = " << x << ','; _DBG(s + 1, a...); }

#ifdef LOCAL
#define _upgrade ios_base::sync_with_stdio(0);
#define DBG(...) _DBG(#__VA_ARGS__, __VA_ARGS__)
#else
#define _upgrade ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define DBG(...) (__VA_ARGS__)
#define cerr if(0) cout
#endif

// ********************** CODE ********************** //

const int N = 1e6 + 7;

int n, dp[N];

int main()
{
    _upgrade
    
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        int k = dp[i - 1];
        dp[i] = 1e9;
        for (int j = max(1, k - 20); j <= min(k + 20, i); j++)
        {
            if (dp[i - __builtin_popcount(j)] < j)
            {
                dp[i] = j;
                break;
            }
        }
    }

    vector<int> v;
    while (n > 0)
    {
        v.push_back(dp[n]);
        n -= __builtin_popcount(dp[n]);
    }
    cout << sz(v) << "\n";
    for (auto x: v)
        cout << x << " ";
    cout << "\n";

    return 0;
}