/*
    De vazut surse precedente pentru alte solutii.
*/
#include <cstdio>

const int INF = 1000000000;

const int N_MAX = 105;

int d[N_MAX][N_MAX],n;

inline int min(int a, int b)
{
    return (a<b)?a:b;
}

void citeste()
{
    scanf("%d",&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 roy_floyd()
{
    for (int k = 1; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                d[i][j] = min(d[i][j],d[i][k] + d[k][j]);
}

void scrie()
{
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
            printf("%d ",(i == j || d[i][j]==INF)?0:d[i][j]);
        printf("\n");
    }
}

int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    citeste();
    roy_floyd();
    scrie();
    return 0;
}