#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int maxn = 1e5 + 5;

inline int gi()
{
	char c = getchar();
	while (c < '0' || c > '9') c = getchar();
	int sum = 0;
	while ('0' <= c && c <= '9') sum = sum * 10 + c - 48, c = getchar();
	return sum;
}

const int w[2][9] = {1, 2, 3, 5, 8, 13, 21, 30, 39, 1, 2, 4, 7, 12, 20, 29, 38, 52};

int n, p[15];
ll e[15][15];


ll calc(int n)
{
	ll Max = 0;
	for (int i = 0; i < n; ++i) p[i] = i;
	do {
		ll sum = 0;
		for (int i = 0; i < n - 1; ++i) sum += e[p[i]][p[i + 1]];
		Max = max(Max, sum);
	} while (next_permutation(p, p + n));
	return Max;
}

int main()
{
	n = gi();
	ll M = 0;
	for (int i = 1; i < n; ++i) {
		for (int j = 0; j < i; ++j)
			e[i][j] = e[j][i] = w[1][j] * (M + 1);
		M = calc(i + 1);
		//printf("%lld\n", M);
	}
	
	for (int i = 0; i < n; ++i, puts(""))
		for (int j = 0; j < n; ++j)
			printf("%lld ", e[i][j]);
	
	return 0;
}
