#include <bits/stdc++.h>
#ifdef LOC
#include "debuglib.h"
#else
#define deb(...)
#define DBP(...)
#endif
using namespace std;
using   ll         = long long;
using   vi         = vector<int>;
using   pii        = pair<int, int>;
#define pb           push_back
#define mp           make_pair
#define x            first
#define y            second
#define rep(i, b, e) for (int i = (b); i < (e); i++)
#define each(a, x)   for (auto& a : (x))
#define all(x)       (x).begin(), (x).end()
#define sz(x)        int((x).size())

void solve(int n) {
	vi ans;
	int bits = 0, mx = 0;
	while (bits < n) bits += __builtin_popcount(++mx);

	for (int e = mx; e >= 1; e--) {
		int b = __builtin_popcount(e);
		if (bits-b < n) {
			ans.pb(e);
		} else {
			bits -= b;
		}
	}

	cout << sz(ans) << '\n';
	each(a, ans) cout << a << ' ';
	cout << '\n';
}

int main() {
	cin.sync_with_stdio(0); cin.tie(0);
	cout << fixed << setprecision(10);
	int n; cin >> n;
	solve(n);
	cout << flush; _Exit(0);
}