#include <iostream>
#include <fstream>
#include <algorithm>
#define Nmax 101
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
    int n,i,j,k,a[Nmax][Nmax];
    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][j]!=0 || i==j)
            a[i][j]=min(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';
    }
    return 0;
}