#include <bits/stdc++.h>
using namespace std;
const int maxn=510;
int a[maxn][maxn];
const int inf=1.5e9;
int ans[maxn][maxn];
typedef long long ll;
const ll p1=31,p2=131;
const ll mod1=1e9+7,mod2=1e9+9;
typedef pair<ll,ll> hs;
const hs p = make_pair(p1,p2);
hs &operator+=(hs &a, hs b) {
    a.first=(a.first+b.first)%mod1;
    a.second=(a.second+b.second)%mod2;
    return a;
}
hs operator+(hs a, hs b) { return a += b; }
hs &operator-=(hs &a, hs b) {
    a.first=(a.first-b.first+mod1)%mod1;
    a.second=(a.second-b.second+mod2)%mod2;
    return a;
}
hs operator-(hs a, hs b) { return a -= b; }
hs &operator*=(hs &a, hs b) {
    a.first=(a.first*b.first)%mod1;
    a.second=(a.second*b.second)%mod2;
    return a;
}
hs operator*(hs a, hs b) { return a *= b; }
struct kkk{
    int x,len;
    hs c;
    kkk(){}
    kkk(int _x,int _len,hs _c){
        x=_x,len=_len,c=_c;
    }
    bool operator<(kkk k1)const{
        return len>k1.len;
    }
};
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;cin>>n;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)cin>>a[i][j];
    }
    auto add= [&](hs &x,hs y){
        x+=y;
    };
    auto solve = [&](int root){
        vector<int> dis(n+1,inf);
        vector<hs> cnt(n+1);
        priority_queue<kkk,vector<kkk>> qu;
        qu.push(kkk(root,0,{1,1}));
        while(!qu.empty()){
            kkk k1=qu.top();qu.pop();
            // cout<<"root="<<root<<" x="<<k1.x<<" len="<<k1.len<<"\n";
            if(k1.len>dis[k1.x])continue;
            if(k1.len<=dis[k1.x]){
                add(cnt[k1.x],k1.c);
                // cout<<"cnt="<<cnt[k1.x].first<<"\n";
            }
            if(k1.len<dis[k1.x]){
                dis[k1.x]=k1.len;
            }
            else continue;
            for(int j=1;j<=n;j++)if(dis[k1.x]+a[k1.x][j]<dis[j]){
                qu.push(kkk{j,dis[k1.x]+a[k1.x][j],cnt[k1.x]});
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++)if(i!=j){
                if(dis[i]+a[i][j]==dis[j]&&cnt[j]==cnt[i]){
                    ans[i][j]=1;
                    // if(i==1&&j==3)cout<<root<<"\n";
                }
            }
        }
    };
    for(int i=1;i<=n;i++)solve(i);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)cout<<ans[i][j];;
        cout<<"\n";
    }
}