#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

const int N = 1e2;
const int INF = 1e9;
int n;
int d[N + 1][N + 1];

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
        {
            fin >> d[i][j];   
            if (d[i][j] == 0 && i != j)
                d[i][j] = INF;
        }
    for (int k = 1; k <= n; k++)
    { //d_k[i][j] = distanta minima de la i la j daca putem folosi ca noduri intermediare nodurile din multimea 1...k
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                if (d[i][k] + d[k][j] < d[i][j])
                    d[i][j] = d[i][k] + d[k][j];
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (d[i][j] == INF)
                d[i][j] = 0;
            fout << d[i][j] << " ";
        }
        fout << '\n';
    }
    return 0;
}