#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <iomanip>
#include <array>
#include <numeric>
#include <regex>
#include <bitset>
#include <deque>

using namespace std;
typedef long long ll;
typedef pair<int, int> p_ii;

const int INF = 1e9;
const double PI = acos(-1.0);
const ll MOD = 1e9 + 7;

int pow2[31], C[31][31];

int main() {
	pow2[0] = 1;
	for (int i = 0; i < 30; i++)
	{
		pow2[i + 1] = pow2[i] * 2;
	}
	C[1][0] = C[1][1] = 1;
	for (int i = 2; i < 31; i++)
	{
		for (int j = 0; j < i + 1; j++)
		{
			if (j == 0)C[i][j] = C[i - 1][j];
			else if (j == i)C[i][j] = C[i - 1][j - 1];
			C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
		}
	}

	int K; cin >> K;

	if (K == 0) {
		cout << 1 << endl;
		cout << 0 << endl;
		return 0;
	}

	int cnt0=-1, cnt1=-1;
	for (int i = 0; i <= 30; i++)
	{
		if (!(cnt0 == -1 && cnt1 == -1))break;
		for (int j = 0; j <= 30; j++)
		{
			if (i + j > 30)continue;
			if ((ll)pow2[i] * C[j][2] == (ll)K){
				cnt0 = i;
				cnt1 = j;
				break;
			}
		}
	}

	vector<int> res;
	for (int i = 0; i < cnt0; i++)
	{
		res.push_back(0);
	}
	for (int j = 0; j < cnt1; j++)
	{
		res.push_back(1);
	}

	cout << res.size() << endl;
	for (int i = 0; i < res.size(); i++)
	{
		if (i != 0)cout << " ";
		cout << res[i];
	}
	cout << endl;

	return 0;
}