#include <bits/stdc++.h>
#define nmax 101
using namespace std;
int a[nmax][nmax],n;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void Citire()
{
    int i,j;
    fin>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fin>>a[i][j];
}
void RF()
{
    int i,j,k;
    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] &&(a[i][j]>a[i][k]+a[k][j] || !a[i][j])) && i!=j)
                    a[i][j]=a[i][k]+a[k][j];
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
            fout<<a[i][j]<<" ";
        fout<<"\n";
    }

    /// (a[i][k] && a[k][j]-exista drum i-k,k-j)
    ///(i!=j =ar reprezenta ciclu)
    ///(!a[i][j]-nu exista arc i->j insa poate exista drum i->k->j prin nodurile intermediare (1,2,,k)
}
int main()
{
    Citire();
    RF();
    fin.close();
    fout.close();
    return 0;
}