#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch-'0'<0||ch-'0'>9){if(ch=='-') f=-1;ch=getchar();}
    while(ch-'0'>=0&&ch-'0'<=9){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
ll re[15][15];
int dis[]={0,1,2,4,7,12,20,29,38,52,73};
int n;
int book[15];
int a[15];
int vis[15];
ll mx;
void dfs(int x,int n)
{
    if(x>n)
    {
        ll tmp=0;
        for(int i=2;i<=n;i++)  tmp=tmp+re[a[i-1]][a[i]];
        mx=max(mx,tmp);
        return;
    }
    for(int i=1;i<=n;i++)
    {
        if(!vis[i])
        {
            a[i]=x;
            vis[i]=1;
            dfs(x+1,n);
            vis[i]=0;
        }
    }
}
int main()
{
    n=read();
    re[1][2]=re[2][1]=1;
    for(int i=3;i<=n;i++)
    {
        mx=0;
        dfs(1,i-1);
        for(int j=1;j<i;j++)  re[i][j]=re[j][i]=(ll)dis[j]*(mx+1);
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)  printf("%lld ",re[i][j]);
        puts("");
    }
    return 0;
}