#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
//#define int ll


ifstream fin("royfloyd.in"); ofstream fout("royfloyd.out");
#define cin fin
#define cout fout

int adj[101][101];
int n;
bool v[101][101];



int32_t main(){
INIT
cin>>n;
for(int i=1; i<=n; i++){
    for(int j=1; j<=n; j++){
        cin>>adj[i][j];
    }
}



for(int k=1; k<=n; k++){
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            if( (adj[i][k]>0 && adj[k][j]>0) && (i!=j)  ){

            if(adj[i][j]>0){adj[i][j]=min(adj[i][k]+adj[k][j], adj[i][j]);}
            else{adj[i][j]=adj[i][k]+adj[k][j];}

            }
        }
    }
}


for(int k=1; k<=n; k++){
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            if( (v[i][k] && v[k][j]) && (i!=j)  ){

            if(v[i][j]){adj[i][j]=min(adj[i][k]+adj[k][j], adj[i][j]);}
            else{adj[i][j]=adj[i][k]+adj[j][k];}
            v[i][j]=true;
            }
        }
    }
}


for(int i=1; i<=n; i++){
    for(int j=1; j<=n; j++){
        cout<<adj[i][j]<<" ";
    }
    cout<<"\n";
}


return 0;
}