#include <iostream>
#include <fstream>

using namespace std;

#define MAX_N 105
#define INF 1005

int main()
{
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");
    int i, j, k, v[MAX_N][MAX_N], n;

    f >> n;
    for (i = 1; i <= n; i++)
    {
        for (j = 1; j <= n; j++)
        {
            f >> v[i][j];
            if (v[i][j] == 0 && i != j)
                v[i][j] = INF;
        }
    }

    for (k = 1; k <= n; k++)
        for(i = 1; i <= n; i++)
            for (j = 1; j <= n; j++)
                if (v[i][j] > v[i][k] + v[k][j])
                        v[i][j] = v[i][k] + v[k][j];

    for (i = 1; i <= n; i++)
    {
        for (j = 1; j <= n; j++)
            if (v[i][j] == INF)
                g << 0 << ' ';
            else
                g << v[i][j] << ' ';

        g << '\n';
    }
    return 0;
}