#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

#define maxN 105

int C[maxN][maxN];


int main()
{
    freopen ("royfloyd.in", "r", stdin);
    freopen ("royfloyd.out", "w", stdout);

    int N;
    scanf ("%d", &N);

    for (int i = 1; i <= N; ++ i)
        for (int j = 1; j <= N; ++ j) scanf ("%d", &C[i][j]);

    for (int k = 1; k <= N; ++ k)
        for (int i = 1; i <= N; ++ i)
            for (int j = 1; j <= N; ++ j)
            {
                if (! C[i][k] || ! C[k][j]) continue;
                if (! C[i][j] && i != j) C[i][j] = C[i][k] + C[k][j];
                else C[i][j] = min (C[i][j], C[i][k] + C[k][j] );
            }

    for (int i = 1; i <= N; ++ i)
    {
        for (int j = 1; j <= N; ++ j) printf ("%d ", C[i][j]);
        printf ("\n");
    }

    return 0;
}