#include<iostream>
#include<cstdio>
#include<vector>
#define N 25
#define M 33554432
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
char obuf[1<<27],*O=obuf;
int n,b[N+1],c[N+1],cs[N+1];
bool used[M+1],vis[N+1];
vector<short>solve(int sn)
{
	if (sn==1) return {1,1};
	else if (sn==2) return {1,2,1,2};
	else if (sn==3) return {1,3,1,2,1,3,1,2};
	else
	{
		int cnt=0;
		vector<short>p=solve(sn-2);
		vector<short>sp;
		vector<short>st;
		int d=(1<<(sn-1))%sn,lst=-1;
		for (int i=1;i<=sn-2;++i) c[i]=0;
		for (int i=1;i<=sn-2;++i) cs[i]=((1<<(sn-1))/sn+(i<=d))<<1;
		for (int i=0;i<p.size();++i) c[p[i]]++;
		for (int i=1;i<=sn-2;++i) b[i]=(c[i]<<1)-(cs[i]>>1);
		if (b[p.back()]<2)
		{
			for (int i=1;i<p.size();++i)
				if (b[p[i-1]]>=2)
				{
					for (int j=0;j<p.size();++j) sp.push_back(p[(i+j)%p.size()]);
					p=sp;
					break;
				}
		}
		b[p.back()]--;
		for (int i=p.size()-1;i>=0;--i)
		{
			if (b[p[i]]) b[p[i]]--,used[i]=1;
			else used[i]=0;
		}
		for (int i=0;i+1<p.size();++i)
			if (used[i])
			{
				cnt++;
				for (int j=lst+1;j<=i-1;++j) st.push_back(p[j]);
				if (cnt&1) st.push_back(sn);
				else st.push_back(sn-1);
				for (int j=i-1;j>=lst+1;--j) st.push_back(p[j]);
				if (cnt&1) st.push_back(sn-1);
				else st.push_back(sn);
				for (int j=lst+1;j<=i;++j) st.push_back(p[j]);
				lst=i;
			}
		for (int i=lst+1;i+1<p.size();++i) st.push_back(p[i]);
		st.push_back(sn);
		for (int i=p.size()-2;i>=lst+1;--i) st.push_back(p[i]);
		st.push_back(sn-1);
		for (int i=lst+1;i+1<p.size();++i) st.push_back(p[i]);
		st.push_back(sn);
		for (int i=p.size()-2;i>=0;--i) st.push_back(p[i]);
		st.push_back(sn-1);
		return st;
	}
}
int main()
{
	vector<short>p;
	n=read(),p=solve(n);
	for (int i=0;i<p.size();++i)
	{
		for (int j=1;j<=n;++j) printf("%d",vis[j]);
		puts("");
		vis[p[i]]^=1;
	}
	return 0;
}