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

typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pll;
typedef vector<bool> vb;
const ll oo = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define FOR(i,a,b) for (ll i = (a); i < (b); i++)
#define FORD(i,a,b) for (ll i = (b)-1; i >= (a); i--)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define TR(X) ({ if(1) cerr << "TR: " << (#X) << " = " << (X) << endl; })

vl weights = {1,2,4,7,12,20,29,38,52,73};

ll max_hamilton(vvl adj) {
	ll n = sz(adj), res = 0;
	vl p(n);
	iota(all(p),0);
	do {
		ll cur = 0;
		FOR(i,1,n) cur += adj[ p[i] ][ p[i-1] ]; 
		res = max(res,cur);
	} while (next_permutation(all(p)));
	return res;
}

bool check(vvl adj) {
	ll n = sz(adj);
	vl p(n);
	iota(all(p),0);
	set<ll> s;
	do {
		ll cur = 0;
		if (p[0] > p[n-1]) continue;
		FOR(i,1,n) cur += adj[ p[i] ][ p[i-1] ];
		if (s.count(cur)) return false;
		s.insert(cur);
	} while (next_permutation(all(p)));
	return true;
}

vvl solve(ll n) {
	if (n == 2) return {{0,1},{1,0}};
	n--;
	vvl res = solve(n);
	
	ll hmax = max_hamilton(res) + (n==2);
	
	res.pb(vl(n+1));
	FOR(i,0,n) res[i].resize(n+1);
	
	FOR(i,0,n) res[i][n] = res[n][i] = weights[i] * hmax;
	return res;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	ll n; cin >> n;
	vvl res = solve(n);
	FOR(i,0,n) FOR(j,0,n) cout << res[i][j] << " \n"[j+1==n];
	cout << endl;
	cerr << max_hamilton(res) << endl;
	assert(check(res));
}

