#include<bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int NMAX=105,INF=0x3F3F3F3F;
int n,x,d[NMAX][NMAX];
int main()
{
    f>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
        {
            f>>x;
            d[i][j]=x;
            if(i!=j && d[i][j]==0)/// we don't have an edge between i and j
                d[i][j]=INF;/// hence we have the distance equal to INF
        }

    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
                d[i][j]=min(d[i][j],d[i][k]+d[k][j]);

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            g<<d[i][j]<<' ';
        g<<'\n';
    }
    return 0;
}