#include <bits/stdc++.h>

using namespace std;

const int nmax = 110;
const int inf = 0x3f3f3f3f;

int n , i , j;
int a[nmax][nmax];

void bagaroyfloyd()
{
    int k , i , j;
    for (k = 1; k <= n; ++k)
        for (i = 1; i <= n; ++i)
            for (j = 1; j <= n && i != k; ++j)
            {
                if (i == j || k == j) continue;
                a[i][j] = min(a[i][j] , a[i][k] + a[k][j]);
            }
}

int main()
{
    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] == 0) a[i][j] = inf;
        }

    bagaroyfloyd();

    for (i = 1; i <= n; ++i, printf("\n"))
        for (j = 1; j <= n; ++j)
        {
            if (a[i][j] == inf) a[i][j] = 0;
            printf("%d ", a[i][j]);
        }

    return 0;
}