#include <cstdio>
#include <algorithm>

using namespace std;
#define INF 1005
#define MAX 100

int drum[MAX+2][MAX+2];

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