// Solution #1 : Max path length = 83 907 014 282
 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
long long N, a[11][11], r = 1, e[10] = { 1, 2, 4, 7, 12, 20, 29, 38, 52 };
 
long long solve() {
	vector<long long>E, F;
	for (int i = 0; i < N; i++) E.push_back(i);
 
	do {
		long long s = 0;
		for (int i = 0; i < N - 1; i++) {
			s += a[E[i]][E[i + 1]];
		}
		F.push_back(s);
	} while (next_permutation(E.begin(), E.end()));
 
	sort(F.begin(), F.end());
	F.erase(unique(F.begin(), F.end()), F.end());
 
	long long LIM = 1;
	for (int i = 1; i <= N; i++) LIM *= i;
	LIM /= 2;
 
	//cout << F.size() << " " << LIM << endl;
	if (F.size() == LIM) return F[F.size() - 1];
	return (1LL << 60);
}
 
int main() {
	cin >> N; a[0][1] = 1; a[1][0] = 1; a[0][2] = 2; a[2][0] = 2; a[1][2] = 3; a[2][1] = 3;
 
	for (int i = 3; i < N; i++) {
		long long NN = N; N = i;
		long long V = solve(); N = NN;
		r = V + 1;
		for (int j = 0; j < i; j++) {
			long long cost = r * e[j];
			a[i][j] = cost; a[j][i] = cost;
		}
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) { if (j) cout << " "; cout << a[i][j]; } cout << endl;
	}
	return 0;
}