#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#define INF 100000000
using namespace std;

int d[100][100];

int main() {
	ifstream in("royfloyd.in");
	ofstream out("royfloyd.out");
	int n;

	in >> n;

	for (int i = 1 ; i <=n ; i++)
		for (int j = 1 ; j <= n ; j++) {
			in >> d[i][j];
			if ((d[i][j] == 0) && (i != j))
				d[i][j] = INF;
		}
		
	for (int k = 1 ; k <= n ; k++)
		for (int i = 1 ; i <=n ; i++)
			for (int j = 1 ; j<= n ; j++)
				d[i][j] = min (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)
				out << 0 << " ";
			else out << d[i][j] << " ";
		out << endl;
	}


	in.close();
	out.close();

	return 0;
}