#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

#define INF 100000

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

int n; // nr de noduri
vector<vector<int>>d; // matricea costului minim al unui drum de la i la j care are vf intermediare in {1, ..., k}
vector<vector<int>>p; // predecesorul unui nod j pe drumul minim curent gasit de la i la j care are vf intermediare {1, ..., k}

void floydWarshall(){

    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            if(i != j && d[i][j] == 0){

                d[i][j] =INF;
                p[i][j] = 0;
            } else
                p[i][j] = i;


	for (int k = 1; k <= n; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				if (d[i][j] > d[i][k] + d[k][j])
				{
					d[i][j] = d[i][k] + d[k][j];
					p[i][j] = p[k][j];
				}
}

int main()
{
    f >> n;

    d.resize(n + 1, vector<int>(n + 1));
    p.resize(n + 1, vector<int>(n + 1));


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

    for(int i = 1; i <= n; i++)
        d[i][i] = p[i][i] = 0;

    floydWarshall();

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++)
            if(d[i][j] != INF && i != j)
                g << d[i][j] << " ";
            else
                g << 0 << " ";
        g << "\n";
    }

    return 0;
}