#include<stdio.h>
#include<algorithm>
#define MAXN 100
FILE*fin,*fout;
int cost[MAXN+1][MAXN+1];
int d[2][MAXN+1][MAXN+1];
int main()
{
    fin=fopen("royfloyd.in","r");
    fout=fopen("royfloyd.out","w");
    int N;
    fscanf(fin,"%d",&N);
    for(int i=1; i<=N; i++)
    {
        for(int j=1; j<=N; j++)
        {
            fscanf(fin,"%d",&cost[i][j]);
        }
    }
    for(int i=1; i<=N; i++)
    {
        for(int j=1; j<=N; j++)
        {
            d[0][i][j]=cost[i][j];
        }
    }
    bool c=1;
    for(int k=1; k<=N; k++)
    {
        for(int i=1; i<=N; i++)
        {
            for(int j=1; j<=N; j++)
            {
                d[c][i][j]=std::min(d[!c][i][k]+d[!c][k][j],d[!c][i][j]);
            }
        }
        c=!c;
    }
    for(int i=1; i<=N; i++)
    {
        for(int j=1; j<=N; j++)
        {
            fprintf(fout,"%d ",d[!c][i][j]);
        }
        fprintf(fout,"\n");
    }
    fclose(fin);
    fclose(fout);
    return 0;
}