// Marcin Knapik

#pragma GCC optimize ("O3")
#include<bits/stdc++.h>
using namespace std;

#define FOR(i, n) for (int i = 0; i < n; i++)
#define f first
#define s second
#define pb push_back
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()

using ll = long long;
using vi = vector<int>;

void solve () {
    int n;
    cin >> n;

    vi pref{0};
    for(int i = 1; pref.back() < n; i++){
        pref.pb(pref.back() + __builtin_popcount(i));
    }

    vi ans {sz(pref) - 1};
    n -= __builtin_popcount(ans[0]);

    while(n > 0){
        for(int j = max(1, ans.back() - 100); j < ans.back(); j++){
            if(pref[j] >= n){
                ans.pb(j);
                n -= __builtin_popcount(j);
                break;
            }
        }
    }
    
    cout << sz(ans) << '\n';
    for(auto & u : ans){
        cout << u << ' ';
    }
    cout << '\n';
}

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

    int tests = 1;
    // cin >> tests;

    for (int test = 1; test <= tests; test++) {
        solve();
    }

    return 0;
}