#include <bits/stdc++.h>
#define mod 1000000007
#define mod998 998244353
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define mkp make_pair
typedef long long ll;
using namespace std;

const ll x[10] = { 1,2,4,7,12,20,33,54,88,143 };

int N;
ll a[10][10], b;

int main() {
	cin >> N;
	b = 1;
	for (int i = 0; i < N; ++i) {
		for (int j = i + 1; j < N; ++j) {
			a[i][j] = a[j][i] = x[j - i - 1] * b + 1;
		}
		b *= x[9 - i] - 1;
	}
	a[9][8] = a[8][9] = 1;
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < N; ++j) {
			cout << a[i][j];
			if (j != N - 1)cout << sp;
		}
		cout << endl;
	}
	/*
	vector<int>v{ 0,1,2,3,4,5,6,7,8,9 };
	map<ll, vector<int>>mp;
	do {
		if (v.front() > v.back())continue;
		ll t = 0;
		for (int i = 0; i < 9; ++i) {
			t += a[v[i]][v[i + 1]];
		}
		if (t > 1e11) {
			cout << t << endl;
			for (int i : v) {
				cout << i << sp;
			}
			cout << endl;
		}
		if (mp.find(t) != mp.end()) {
			cout << t << endl;
			for (int i : mp[t]) {
				cout << i << sp;
			}
			cout << endl;
			for (int i : v) {
				cout << i << sp;
			}
			cout << endl;
		}
		else {
			mp[t] = v;
		}
	} while (next_permutation(v.begin(), v.end()));*/
}