#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

/////////////////////////////////////
vvll l(11, vll(10, 0));

bool ch(vll v) {
	ll N = v.size();
	vector<bool> c(v[N-1]*2, 0);
	rep(i,N)for(ll j=i+1;j<N;j++){
		if (c[v[i] + v[j]] == 1) { return false; }
		c[v[i] + v[j]] = 1;
	}
	return true;
}

bool dfs(vll v, ll x, ll M) {
	if (v.size() == M) {
		rep(i, M)l[M][i] = v[i];
		return true;
	}
	else {
		ll y = v[v.size() - 1];
		for (ll z = y + 1; y+z < x; z++) {
			v.push_back(z);
			if (ch(v)) { if (dfs(v, x, M)) { return true; } }
			v.pop_back();
		}
	}

	return false;
}


int main() {
	vll s = { 0,0,2,4,8,12,20,32,44,64,81 };
	for(ll i=2;i<=10;i++) {
		vll v(1, 0);
		dfs(v,  s[i], i);
		//rep(j, 10)cout << l[i][j]<<" ";
		//cout << endl;
	}

	//return 0;

	ll N;
	cin >> N;

	vvll g(N + 1, vll(N+1, 0));

	ll mx = 2;
	g[2][1] = 1;

	for (ll i = 3; i <= N; i++) {
		repn(j, i - 1) {
			g[i][j] = mx * l[i][j];
		}

		mx = mx + g[i][i - 1] + g[i][i - 2];
	}

	repn(i, N) {
		repn(j, N) {
			if (i >= j) { cout << g[i][j]<<" "; }
			else { cout << g[j][i] << " "; }
		}
		cout << endl;
	}
	
}
