#include <cstdio>
#include <algorithm>

#define NMAX 101
#define INF ((1 << 30) + (1 << 29))

using namespace std;

int n;
int d[NMAX][NMAX];

void read()
{
    freopen("royfloyd.in", "r", stdin);

    scanf("%d\n", &n);

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

            if(d[i][j] == 0)
                d[i][j] = INF;
        }
}

void solve()
{
    for(int k = 1; k <= n; ++ k)
        for(int i = 1; i <= n; ++ i)
            for(int j = 1; j <= n; ++ j)
                if(i != j && d[i][k] != INF && d[k][j] != INF && (d[i][j] > d[i][k] + d[k][j] || d[i][j] == INF))
                    d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}

void write()
{
    freopen("royfloyd.out", "w", stdout);

    for(int i = 1; i <= n; ++ i)
    {
        for(int j = 1; j <= n; ++ j)
            if(d[i][j] == INF)
                printf("0 ");
            else
                printf("%d ", d[i][j]);

        printf("\n");
    }
}

int main()
{
    read();
    solve();
    write();

    return 0;
}