#include <cstdio>
#include <algorithm>
#define nmax 100+5
#define inf 1 << 29
using namespace std;

int a[nmax][nmax];
int n;

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

    int i, j, k;
    int x;

    scanf("%d", &n);
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
        {
            scanf("%d", &x);
            if (x == 0)
                a[i][j] = inf;
            else
                a[i][j] = x;
        }

    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
            for (k = 1; k <= n; k++)
                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 ", 0);
            else
                printf("%d ", a[i][j]);
        printf("\n");
    }
    return 0;
}