#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define DBG(v) cerr << #v << " = " << (v) << endl;

vector<int> f() {
	vector<int> v;
	set<int> s;

	auto ok = [&](const int i) {
		if(s.count(i))
		return false;
		for(int x : v)
		if(s.count(x +i))
		return false;
		return true;
	};

	for (int i = 1; (int) v.size() < 10; ++i)
		if (ok(i)) {
			s.insert(i);
			for (int x : v)
				s.insert(x + i);
			v.push_back(i);
		}

	assert(s.size() == 10 + 10 * 9 / 2);
	return v;
}

ll M[111][111];

ll getMx(const ll n) {
	vector<int> v(n);
	for (int i = 0; i < n; ++i)
		v[i] = i + 1;
	ll mx = 0;
	do {
		ll temp = 0;
		for (int i = 1; i < n; ++i)
			temp += M[v[i - 1]][v[i]];
		mx = max(mx, temp);
	} while (next_permutation(v.begin(), v.end()));
	return mx;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);

	int n;
	cin >> n;
	assert(2 <= n && n <= 10);
	M[1][2] = M[2][1]= 1;

	const vector<int> v = f();

	for (int i = 3; i <= n; ++i) {
		ll mx = getMx(i - 1);

		for (int j = 1; j < i; ++j)
			M[i][j] = M[j][i] =(mx + 1) * v[j - 1];
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j)
			cout << M[i][j] << ' ';
		cout << endl;
	}
	cerr << "mx: " << getMx(n);
	return 0;
}
