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

using namespace std;

int N;
int distances[101][101];

int main()
{
	ifstream f("royfloyd.in");
	ofstream g("royfloyd.out");
	// Program

	f >> N;
	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= N; j++)
		{
			f >> distances[i][j];
		}
	}
	for (int k = 1; k <= N; k++)
	{
		for (int i = 1; i <= N; i++)
		{
			for (int j = 1; j <= N; j++)
			{
				// Exista path intre i , k si k , j
				// Si nu cautam un path de la i la i ( / j,j ) prin k. useless 
				if (distances[i][k] && distances[k][j] && i != j)
				{
					// Daca distanta e mai mare sau nu exista
					if (!distances[i][j] || distances[i][j] > distances[i][k] + distances[k][j])
					{
						distances[i][j] = distances[i][k] + distances[k][j];
					}
				}
			}
		}
	}

	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= N; j++)
		{
			g << distances[i][j] << " ";
		}
		g << endl;
	}

	// Exit
	f.close();
	g.close();
	return 0;
}