#include <bits/stdc++.h>
using namespace std;
long long n, sum, k, roz, it, all;
queue <long long> kol;
int main() {
    cin >> n;
    it = 0;
    while (sum < n) {
        it++;
        sum += __builtin_popcount(it);
    }
    roz = sum - n;
    k = it;
    all = it;
    while (true) {
        if (roz - __builtin_popcount(it) >= 0) {
            roz -=  __builtin_popcount(it);
            kol.push(it);
            k--;
        }
        if (roz == 0) break;
        it--;
    }
    cout << k << endl;
    for(int i = all; i >= 0; i--) {
        if (i == kol.front()) kol.pop();
        else cout << i << " ";
    }
}