#include <fstream>
#define maxn 105

using namespace std;

int d[maxn][maxn];

int min(int a, int b)
{
	if (a < b)
		return a;
	return b;

}

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

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

	for (int k = 1; k <= n; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
			{
				if (i == j)
					continue;
				if (d[i][k] == 0 || d[k][j] == 0)
					continue;

				if (d[i][j] == 0)
					d[i][j] = d[i][k] + d[k][j];
				
				else
					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++)
			out << d[i][j] << " ";
		out << "\n";
	}
}