// e importanta pastrarea ordinii k,i,j
// functioneaza si pe costuri negative

#include <fstream>
using namespace std;

#define Dm 105

int A[Dm][Dm],N;

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

int main()
{
	F>>N;
	for (int i=1;i<=N;++i)
		for (int j=1;j<=N;++j)
			F>>A[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 && A[i][k] && A[k][j] )
				if ( A[i][j] > A[i][k] + A[k][j] || !A[i][j] ) 
					A[i][j]=A[i][k] + A[k][j];	
	for (int i=1;i<=N;++i)
	{
		for (int j=1;j<=N;++j)
			G<<A[i][j]<<' ';
		G<<'\n';
	}
}
