#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

void solve() {
    int k;
    cin >> k;
    if (k == 0) {
        cout << "6\n" << "3 1 4 2 5 4\n";
        return;
    }
    if (k == 1) {
        cout << "6\n" << "1 1 4 5 1 4\n";
        return;
    }
    k--;
    vector<int> v;
    for (int i = 1; i < 28; i++) {
        v.push_back((1 << i) - 1);
    }
    reverse(v.begin(), v.end());

    int cnt = 27;
    long long tot = 0;
    vector<int> ans;
    for (auto x : v) {
        while (x <= k) {
            k -= x;
            ans.push_back(cnt);
            tot += cnt;
        }
        cnt--;
    }

    int cur = 1;
    cout << tot << '\n';
    for (auto x : ans) {
        for (int i = 0; i < x; i++) {
            cout << cur << ' ';
        }
        cur++;
    }
}

int main() {
    ios::sync_with_stdio(0);cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}