#include <cstdio>
#define NMAX 105
#define INF 1000000000
#define min(x, y) (x < y ? x : y)
using namespace std;
int n, D[NMAX][NMAX];

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