#include <cstdio>
#include <algorithm>

using namespace std;

const int INF = (1<<30) - 1;
const int MAX = 101;
int drum[MAX][MAX];

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

    int n, i, j, k, a, b, c;
    scanf("%d", &n);

    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            scanf("%d", &drum[i][j]);
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            if(i != j and !drum[i][j])
                drum[i][j] = INF;
    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                drum[i][j] = min(drum[i][j], drum[i][k] + drum[k][j]);
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
            drum[i][j] == INF ? printf("0 ") : printf("%d ", drum[i][j]);
        printf("\n");
    }

    return 0;
}