#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const string& x, char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> void chmin(T& a, const T& b) { if (a > b) a = b; }
template<class T> void chmax(T& a, const T& b) { if (a < b) a = b; }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }

const int NCK = 300;

ll nck[NCK + 1][NCK + 1];
void calc_nck() {
	FOR(i, NCK) {
		nck[i][0] = nck[i][i] = 1;
		for (int j = 1; j <= i; j++) {
			nck[i + 1][j] = nck[i][j - 1] + nck[i][j];
			if (nck[i + 1][j] > 1e12) nck[i + 1][j] = 1e12 + 1;
		}
	}
}

int solve(string s) {
	int ans = 0;
	FOR(i,1 <<  sz(s)) {
		if (i == 0) continue;
		string cur;
		FOR(j, sz(s)) if (i & (1<<j)) {
			cur.push_back(s[j]);
		}
		if (sz(cur) % 2 == 1) continue;
		bool ok = true;
		FOR(i, sz(cur) / 2) {
			if (cur[i] != cur[sz(cur) / 2 + i]) ok = false;
		}
		ans += ok;
	}
	writerLn(s, ans);
	return ans;
}

ll mul(ll a, ll b) {
	if (a > 1e12 / b) return 1e12 + 1;
	return a * b;
}
ll add(ll& a, ll b) {
	if (a + b > 1e12) return a = 1e12 + 1;
	return a = a + b;
}

ll val[201][201];
ll dp[41][21][41];
void init() {
	calc_nck();
	FOR(i, 41) FOR(j, 41) {
		for (int k = 1; k <= min(i, j); k++) {
			add(val[i][j], mul(nck[i][k], nck[j][k]));
		}
	}
	for (int i = 1; i <= 40; i++) {
		for (int j = 1; j <= 20; j++) {
			for (int k = 1; k <= 40; k++) {
				ll base = (1LL << (i + k - 1)) + (1LL << (2 * j - 1)) - 2;
				ll add = mul(val[i][k], val[j][j]);
				dp[i][j][k] = base + add;
				if (dp[i][j][k] > 1e12) dp[i][j][k] = 1e12 + 1;
			}
		}
	}
}

vector<int> solve(ll n) {
	int idx = 1;
	vector<int> ret;
	while (n >= 3) {
		tuple<int,int,int> mx(-1, -1, -1);
		ll v = 0;
		FOR(i, 41) FOR(j, 21) FOR(k,41) {
			if (dp[i][j][k] <= n && v < dp[i][j][k]) {
				v = dp[i][j][k];
				mx = make_tuple(i, j, k);
			}
		}
		n -= v;
		FOR(k, get<0>(mx)) ret.push_back(idx);
		FOR(k, get<1>(mx)) ret.push_back(idx + 1);
		FOR(k, get<2>(mx)) ret.push_back(idx);
		FOR(k, get<1>(mx)) ret.push_back(idx + 1);
		idx += 2;
	}
	if (n == 3) {
		FOR(x, 3) ret.push_back(idx);
	} else {
		FOR(k, n) {
			ret.push_back(idx);
			ret.push_back(idx);
			idx++;
		}
	}

	return ret;
}

void test() {
	for (int i = 1; i < ten(6); i++) {
		auto l = solve(i + ten(5) * ll(ten(5)));
		if (sz(l) >= 200) {
			writerLn(i);
		}
	}
}

int main() {
	init();

	//solve("12112");
	//solve("11211112");

	//solve("11");
	//solve("1212");
	//solve("1111");
	//solve("112112");
	//solve("1111211112");

	//test();
	// auto hoge = solve(ll(1e12));

	ll n; reader(n);
	auto ans = solve(n);
	writerLn(sz(ans));
	writerArr(ans);

	return 0;
}

Measured memory_bytes: 1280