#include <fstream>
#define INF 1000000000
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,i,j,k,a[105][105];
int main(){
    fin>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fin>>a[i][j];
    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                if(a[i][k] && a[k][j] && i!=j && (!a[i][j] || a[i][k]+a[k][j]<a[i][j]))
                    a[i][j]=a[i][k]+a[k][j];
/** a[i][j] = cel mai mic drum de la i -> j
    pt fiecare pereche i,j verific pt toate nodurile daca e mai bn sa trec prin nodul k
    si sa am drum i->k, k->j (deja calculate) mai scurt decat i->j curent */
    for(i=1;i<=n;i++){
        for(j=1;j<=n;j++)
            fout<<a[i][j]<<" ";
        fout<<"\n";
    }
    return 0;
}