#include <stdio.h>
#define NMAX 101
#define inf 1<<31
#include <algorithm>

using namespace std;

int A[NMAX][NMAX];

int main() {
    int N, k, i, j;
    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", &A[i][j]);
            if (!A[i][j] && i != j)
                A[i][j] = inf;
        }
    for (k = 1; k <= N; ++k)
        for (i = 1; i <= N; ++i)
            for (j = 1; j <= N; ++j)
                    A[i][j] = min(A[i][j], A[i][k] + A[k][j]);
    for (i = 1; i <= N; ++i) {
        for (j = 1; j <= N; ++j)
            //if (A[i][j] != inf)
                printf ("%d ", A[i][j]);
            //else printf ("0 ");
        printf ("\n");
    }
    return 0;
}