#include <stdio.h>
#define NMAX 215
int a[NMAX][NMAX];
int n;
inline int mod(int x){
	if(x <= 0) return x += n;
	if(x > n) return x-=n;
	return x;
}
inline int dist(int x, int y){
	if(y-x > 0) return y-x;
	return y-x + n;
}
int main(){
	freopen("oras.in", "r", stdin);
	freopen("oras.out", "w", stdout);
	scanf("%d", &n);
	if(n == 4){
		printf("-1\n");
		return 0;
	}
	for(int i = 1; i < n; ++i)
		a[i][i+1] = 1;
	a[n][1] = 1;
	for(int i = 1; i <= n; ++i)
		a[i][mod(i-2)] = 1;
	if(n % 2){
		for(int i = 1; i <= n; ++i)
			for(int j = 1; j <= n; ++j)
				if(i != j) 
					if(dist(i, j) >= 3 && dist(i, j) % 2 == 1 && dist(j, i) != 1) a[i][j] = 1;
	}
	else {
		for(int i = 1; i <= n/2; ++i)
			for(int j = 1; j <= n; ++j)
				if(i != j) 
					if(dist(i, j) >= 3 && dist(i, j) % 2 == 1 && dist(j, i) != 1) a[i][j] = 1;
		for(int i = n/2 + 1; i <= n; ++i)
			for(int j = 1; j <= n; ++j)
				if(i != j &&  dist(i,j) %2 == 0) a[i][j] = 1;
	}
	/*for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= n; ++j)
			if(a[i][j] && a[j][i]){
				printf("-1\n");
				return 0;
			}*/
	for(int i = 1; i <= n; ++i){
		for(int j = 1; j <= n; ++j)
			printf("%d", a[i][j]);
		printf("\n");
	}
	return 0;
}