#include<algorithm>
using namespace std;
#define INF 6000000
#define Nmax 110
int v[Nmax][Nmax],N,best[Nmax][Nmax];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&N);
for(int i=1;i<=N;++i)
    for(int j=1;j<=N;++j)
    {
        scanf("%d",&v[i][j]);
  best[i][j]=v[i][j];
    }
for(int k=1;k<=N;++k)
    for(int i=1;i<=N;++i)
        for(int j=1;j<=N;++j)
        {
        if(v[i][k]!=0&&v[k][j]!=0&&(best[i][k]+best[k][j]<best[i][j]||best[i][j]==0)&&i!=j)
        best[i][j]=best[i][k]+best[k][j];
        }
for(int i=1;i<=N;++i)
    {
    for(int j=1;j<=N;++j)
    if(i==j)
    printf("0 ");
    else printf("%d ",best[i][j]);
    printf("\n");
    }
}