#include<bits/stdc++.h>
using namespace std;
int n, len, a[100010], b[100010] = {0}, f = 0;
int power(int x, int n) {
	if(n == 0) {
		return 1;
	}
	if(n == 1) {
		return x;
	}
	int p = power(x, n / 2);
	if(n % 2 == 1) {
		return p * p * x;
	}
	else {
		return p * p;
	}
}
int dfs(int x, int s) {
	if(f == 1) {
		return 0;
	}
	if(x == len) {
		for(int i = 0; i < len; i ++) {
			cout << b[i] << ' ';
		}
		f = 1;
	}
	s = (s << 1) - b[x - n] * power(2, n);
	if(a[s] == 0) {
		a[s] = 1;
		b[x] = 0;
		dfs(x + 1, s);
		a[s] = 0;
	}
	if(a[s + 1] == 0) {
		a[s + 1] = 1;
		b[x] = 1;
		dfs(x + 1, s + 1);
		a[s + 1] = 0;
	}
}
int main() {
    freopen("cowsonparade.in", "r", stdin);
    freopen("cowsonparade.out", "w", stdout);
	cin >> n;
	len = power(2, n) + n - 1;
	a[0] = 1;
	dfs(n, 0);
	return 0;
}