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

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()
#define dump(x) cout << #x << " = " << (x) << endl
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

template<class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}
 
template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	os<<"{";
	rep(i, v.size()) {
		if (i) os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

const int maxn = 10;

ll d[maxn][maxn];

int main() {
	vector<ll> dp(maxn);
	dp[0] = 1;
	dp[1] = 2;

	for (int i = 2; i < maxn; ++i) {
		set<ll> st;
		rep(j, i) rep(k, j) {
			st.insert(dp[k] + dp[j]);
		}

		ll c = dp[i-1] + 1;
		while (true) {
			bool ok = true;
			rep(j, i) {
				if (st.count(c + dp[j]) || st.count(c)) {
					ok = false; break;
				}
			}
			if (ok) {
				break;
			}
			c++;
		}
		dp[i] = c;
	}

	//cout << dp << endl;

	int N; cin >> N;

	d[0][1] = d[1][0] = 1;

	for (int i = 2; i < N; ++i) {
		ll c = 0;
		vi pm;
		rep(j, i) pm.pb(j);
		vector<ll> cst;

		do {
			ll s = 0;
			rep(j, (int)pm.size()-1) {
				s += d[pm[j]][pm[j+1]];
			}
			cst.pb(s);
			c = max(c, s);
		} while (next_permutation(ALL(pm)));
		++c;
		//dump(cst);
		//sort(ALL(cst));
		//cst.erase(unique(ALL(cst)), cst.end());
		//dump(cst.size());
		//cerr << i << " " << c << endl;

		rep(j, i) d[j][i] = d[i][j] = c * dp[j];
	}

	rep(i, N) {
		rep(j, N) {
			printf("%lld%c", d[i][j], j == N-1 ? '\n' : ' ');
		}
	}

	return 0;
}