#include <bits/stdc++.h>

using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[105][105],n;
void RoyFloyd()
{
    ///folosind fiecare nod k vedem daca putem face o legatoru intre cele 2 noduri i si j
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
            {
                if(a[i][k]!=0&&a[k][j]!=0&&i!=j&&
                   (a[i][j]>a[i][k]+a[k][j]||a[i][j]==0))
                    a[i][j]=a[i][k]+a[k][j];
            }
}




int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            fin>>a[i][j];
    RoyFloyd();
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            fout<<a[i][j]<<" ";
        fout<<"\n";
    }
    return 0;
}