#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pb push_back
#define fi first 
#define se second
#define all(x) (x.begin(),x.end())

int n,m,k,T;
string s;


void solve()
{
    cin>>n;
    vector<vector<int>>a(n+1,vector<int>(n+1)),dis(n+1,vector<int>(n+1)),ans(n+1,vector<int>(n+1)),last(n+1,vector<int>(n+1));
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cin>>a[i][j];dis[i][j]=a[i][j];
        }
    }
    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(i==k||j==k)continue;
                if(dis[i][k]+dis[k][j]<=dis[i][j]){
                    dis[i][j]=dis[i][k]+dis[k][j];
                    last[i][j]=k;
                }
                //dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            //cout<<last[i][j]<<" ";
            if(dis[i][j]==a[i][j]&&last[i][j]==0)ans[i][j]=1;
        }
        //cout<<endl;
    }
    for(int i=1;i<=n;i++)ans[i][i]=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cout<<ans[i][j];
        }
        cout<<endl;
    }
}

signed main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    T=1;
//    cin>>T;
    while(T--)solve();
}