#include <cstdio>
#include <algorithm>
using namespace std;
#define INF 0xfffffff
#define MAX 101

int n,c[MAX][MAX];

void roy(){
    for(int k=1;k<=n;k++)
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
    if( i!=k && k!= j && i!=j )c[i][j] = min( c[i][j],c[i][k] + c[k][j] );
}

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 ",&c[i][j]);
            if( c[i][j] == 0 ) c[i][j] = INF;
        }

    roy();

    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)printf("%d ",c[i][j] == INF ? 0 : c[i][j]); printf("\n"); }

    return 0;
}