#include <cstdio>
using namespace std;
#define MAX 101
#define INF 1000000
int d[MAX][MAX], n;
int main()
{
    int i, j, k;
    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", &d[i][j]);
            if(d[i][j]==0) d[i][j] = INF;
        }
    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            if(d[i][j]>d[i][k]+d[k][j])
                d[i][j] = d[i][k]+d[k][j];
    for(i=1; i<=n; i++){
        for(j=1; j<=n; j++)
            if(i==j or d[i][j]==INF)printf("0 ");
            else printf("%d ", d[i][j]);
        printf("\n");
    }
    return 0;
}