#include<cstdio>
#include<set>
#define FIT(a,b) for(vector<pair<pair<int,int>,int> > >::iterator a=b.begin();a!=b.end();a++)
#include<stack>
#define ROF(a,b,c) for(register int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(register int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#include<map>
#define debug cerr<<"OK";
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define mod 1000000007
#define N 510
using namespace std;
/*ifstream f("a.in");
ofstream g("a.out");*/
/*int dx[]={0,0,0,1,-1};
int dy[]={0,1,-1,0,0};*/
int n;
char a[N][N];
void go(int a1,int a2,int a3,int a4,int a5,int a6)
{
	a[a1][a4]=1;
	a[a1][a2]=1;
	a[a1][a6]=1;
	a[a2][a3]=1;
	a[a2][a5]=1;
	a[a3][a1]=1;
	a[a3][a4]=1;
	a[a4][a5]=1;
	a[a4][a2]=1;
	a[a5][a6]=1;
	a[a5][a1]=1;
	a[a5][a3]=1;
	a[a6][a4]=1;
	a[a6][a3]=1;
	a[a6][a2]=1;
}
int main ()
{
	freopen("oras.in","r",stdin);
	freopen("oras.out","w",stdout);
	scanf("%d",&n);
	if(n==4)
	{
		printf("-1");
		return 0;
	}
	a[1][2]=a[2][3]=a[3][1]=1;
	for(int i=1;i<n;i+=3)
	{
		for(int j=i+3;j<n;j+=3)
		{
			go(i,i+1,i+2,j,j+1,j+2);
		}
	}
	if(n%3==1)
	for(int i=1;i<n;i+=2)
	{
		a[i+1][n]=1;
		a[n][i]=1;
	}
	FOR(i,1,n)
	FOR(j,i+1,n)
	if(a[i][j]!=(!a[j][i]))
	{
		return 0;
	}
	FOR(i,1,n)
	FOR(j,1,n)
	a[i][j]+='0';
	FOR(i,1,n)
		printf("%s\n",a[i]+1);
    return 0;
}
//Look at me! Look at me! The monster inside me has grown this big!