#include <bits/stdc++.h>
#define ll long long
#define lld long double
#define MOD 1000000007
#define CAP 100000001
#define inf 1000000000000000000LL
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define endl '\n'
#define sz(v) v.size()
#define all(v)    v.begin(),v.end()
#define fast  ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
ll power(ll x,ll y, ll md=MOD){ll res = 1;x%=md;while(y>0){if(y&1)res = (res*x)%md;x = (x*x)%md;y = y>>1;}return res%md;}
#define dbg(x) cout <<#x<<":"<<x<<endl;
ll max1(ll a, ll b, ll c=-inf, ll d=-inf) {ll mx1=(a>b)?a:b, mx2=(c>d)?c:d; return ((mx1>mx2)?mx1:mx2);}
#define int ll

signed main() {
	fast;
	
	ll a[10][10];

	for(int i=0;i<10;i++) a[i][i]=0;

	ll n;
	cin>>n;

	ll aa[n];
	for(int i=0;i<n;i++) aa[i]=i;
	map<ll,ll> mp1;
	
	ll v[]={1, 2, 4, 7, 12, 20, 29, 38, 52};
	ll mul=1;
	
	for(int i=0;i<n;i++){
		ll m1;
		for(int j=0;j<n;j++){
			if(j>i){
				a[i][j]=a[j][i]=v[j-i-1]*mul;
				m1=v[j-i-1];
			}
			//assert(a[i][j]<=10000000000);
		}
		mul*=v[n-1-i-1]+v[n-1-i-2];
	}
	
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++) cout<<a[i][j]<<" ";
		cout<<endl;
	}

} 