/*
Problem: F. Full Clue Problem
Contest: qoj
URL: https://qoj.ac/contest/1195/problem/6189
===================
Memory Limit: 1024.0MB
TimeLimit: 1.0s
*/
#include <iostream>

const int MAXN = 29;
using namespace std;

int hsh[MAXN][MAXN], N;
bool ans1[MAXN][MAXN], ans2[MAXN][MAXN];

int main () {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cerr.tie(0);
	cin >> N;
	if (N == 2) {
		cout << "23\n32\n\n11\n10\n\n01\n11\n";
		return 0;
	}
	if (N == 3) {
		cout << "222\n202\n222\n\n110\n111\n011\n\n011\n111\n110\n";
		return 0;
	}
	for (int i = 1; i < N-1; i++) hsh[i][i+2] = hsh[i+2][i] = 1;
	for (int i = 1; i < N+1; i++) hsh[i][i] = 2;
	for (int i = 1; i < N; i++) hsh[i][i+1] = hsh[i+1][i] = 2;
	hsh[1][1] = hsh[N][N] = 3;
	for (int i = 1; i < N+1; i++) ans1[i][i] = 1;
	for (int i = 1; i < N+1; i+=2) ans1[i+1][i] = ans1[i+1][i+2] = 1;
	for (int i = 1; i < N+1; i++)
		for (int m = 1; m < N+1; m++) ans2[i][m] = ans1[m][i];
	
	for (int i = 1; i < N+1; i++) {
		for (int m = 1; m < N+1; m++) cout << hsh[i][m] << ' ';
		cout << '\n';
	}
	cout << '\n';
	for (int i = 1; i < N+1; i++) {
		for (int m = 1; m < N+1; m++) cout << ans1[i][m] << ' ';
		cout << '\n';
	}
	cout << '\n';
	for (int i = 1; i < N+1; i++) {
		for (int m = 1; m < N+1; m++) cout << ans2[i][m] << ' ';
		cout << '\n';
	}
	
	return 0;
}