// Sorin Davidoi ([email protected]) - 2012-09-24 00:57
// http://infoarena.ro/problema/royfloyd
#include <fstream>
using namespace std;

const int MAXSIZE = 100 + 1;

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

int nodes, best[MAXSIZE][MAXSIZE];

int main() {
	in >> nodes;

	for (int i = 0; i < nodes; ++i)
		for (int k = 0; k < nodes; ++k)
			in >> best[i][k];

	for (int i = 0; i < nodes; ++i)
		for (int j = 0; j < nodes; ++j)
			for (int k = 0; k < nodes; ++k)
				if(best[i][k] > best[i][j] + best[j][k] && best[i][j] && best[j][k])
					best[i][k] = best[i][j] + best[j][k];

	for (int i = 0; i < nodes; ++i)
	{
		for (int k = 0; k < nodes; ++k)
			out << best[i][k] << ' ';
		out << '\n';
	}

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

	return (0);
}