#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
	char c=getchar();bool f=0;x=0;
	while(!isdigit(c)) f|=c=='-',c=getchar();
	while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
	if(f) x=-x;return x;
}
template<class t,class ...A> inline void read(t &x,A &...a){
	read(x);read(a...);
}
template<class t> inline void write(t x){
	if(x<0) putchar('-'),write(-x);
	else{if(x>9) write(x/10);putchar('0'+x%10);}
}

#define int long long

const int N=15,a[]={0,1,2,4,7,12,20,29,38,52,73};
int maxlen,n,ans[N][N],p[N];

signed main(){
	read(n);
	for(int i=1;i<=n;i++) p[i]=i;
	for(int i=2;i<=n;i++){
		for(int j=1;j<i;j++) ans[j][i]=ans[i][j]=(maxlen+1)*a[j];
		if(i==n) continue;
		do{
			int cur=ans[p[i]][p[0]];
			for(int j=2;j<=i;j++) cur+=ans[p[j-1]][p[j]];
			maxlen=max(maxlen,cur);
		}while(next_permutation(p+1,p+1+i));
	}
	for(int i=1;i<=n;i++,puts("")) for(int j=1;j<=n;j++,putchar(' ')) write(ans[i][j]);
}