#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<functional>
#include<cmath>
#include<set>
#include<random>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define F first
#define S second
const long long mod = 1000000007;
const long long inf = 1145141919810;
typedef pair<int, int> P;
typedef pair<P, P> PP;
struct edge {int to, cost;};

int ar[31][31],c2[31];

signed main() {
	int n; cin >> n;
	rep(i, 31)c2[i] = i*(i - 1) / 2;
	rep(i, 31) {
		rep(j, 31) {
			ar[i][j] = (1 << i)*c2[j];
		}
	}
	vector<int>V;
	rep(i, 31) {
		rep(j, 31) {
			if (ar[i][j] == n&&i + j <= 30) {
				rep(k, i)V.push_back(0);
				rep(k, j)V.push_back(1);
				goto F;
			}
		}
	}
F:;
	cout << V.size() << endl;
	rep(i, V.size()) {
		if (i)cout << ' ';
		cout << V[i];
	}
	cout << endl;
}