#include <cstdio>
using namespace std;

const int NMAX = 103;
int G[NMAX][NMAX];

int main () {

    freopen ("royfloyd.in", "r", stdin);
    freopen ("royfloyd.out", "w", stdout);
    int N, i, j, k;
    scanf ("%d", &N);
    for (i = 1; i <= N; ++i)
        for (j = 1; j <= N; ++j)
            scanf ("%d", *(G + i) + j);
    for (k = 1; k <= N; ++k)
        for (j = 1; j <= N; ++j)
            for (i = 1; i <= N; ++i)
                if (G[i][k] && G[k][j] && (G[i][j] > G[i][k] + G[k][j] || !G[i][j]) && i != j)
                    G[i][j] = G[i][k] + G[k][j];
    for (i = 1; i <= N; ++i) {
        for (j = 1; j <= N; ++j)
            printf ("%d ", G[i][j]);
        printf ("\n");
    }

}