#include<iostream>
#include<cstdio>
#include<queue>
#include<vector>
#define INF 0x3f3f3f3f
#define mp make_pair
#define pb push_back
#define maxn 105
using namespace std;
int a[maxn][maxn];
int i,j,n;

void roy_floyd()
{
    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] && a[k][j] && i!=j && (a[i][k]+a[k][j]<a[i][j] || !a[i][j]))
                    a[i][j]=a[i][k]+a[k][j];
}

int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    scanf("%d",&n);
    for(i=1; i<=n; ++i)
        for(j=1; j<=n; ++j)
            scanf("%d",&a[i][j]);
    roy_floyd();
    for(i=1; i<=n; ++i)
    {
        for(j=1; j<=n; ++j)
            printf("%d ",a[i][j]);
        printf("\n");
    }
    return 0;
}