#include<cstdio>
#include<iostream>
#include<algorithm>
#include<deque>
#include<queue>
#include<set>
#include<vector>
using namespace std;

const int INF = 1000000005;
const int NMAX = 205;

int N, k;
int a[NMAX][NMAX];

void citi()
{
	cin >> N;
}

void initializa()
{
	if(N % 2 == 1)
	{
		a[1][2] = 1;
		a[2][3] = 1;
		a[3][1] = 1;
		k = 3;
	}
	else
	{
		k = 6;
	}
}

void construi()
{
	for(int i = k + 2 ; i <= N ; i += 2)
	{
		for(int i = 1 ; i <= N - 1 ; i++)
			a[i][N - 1] = 1;
		a[N - 1][N] = 1;
		for(int i = 1 ; i <= N - 2 ; i++)
			a[N][i] = 1;
	}
}

void scrie()
{
	for(int i = 1 ; i <= N ; i++)
	{
		for(int j = 1 ; j <= N ; j++)
			printf("%d", a[i][j]);
		printf("\n");
	}
}

int main()
{
	freopen("oras.in", "r", stdin);
	freopen("oras.out", "w", stdout);
	citi();
	initializa();
	construi();
	scrie();
	return 0;
}