#include <iostream>
#include <vector>
#include <queue>
#include <utility>
#include <fstream>

using namespace std;

ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");

int main()
{
    int n;
    f >> n;
    int M[n+1][n+1];

    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            f >> M[i][j];

    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                if (M[i][k] && M[k][j] && (M[i][j] > M[i][k] + M[k][j] || !M[i][j]) && i != j)
                    M[i][j] = M[i][k] + M[k][j];

    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
            g << M[i][j] << " ";
        g << endl;
    }

    f.close();
    g.close();
    return 0;
}