#include <fstream>
#include <cstdlib>
#define N_MAX 111
#define oo 1<<29

using namespace std;
int Cost[N_MAX][N_MAX];
inline int _min( int x, int y ) { return x <= y ? x : y; }
int main( void )
{
	int N, i, j, k;
	ifstream in( "royfloyd.in" );
	in>>N;
	for( i=1; i <= N; ++i )
	{
		for( j=1; j <= N; ++j )
		{
			in>>Cost[i][j];
			Cost[i][j]=( 0 == Cost[i][j] ? oo : Cost[i][j] );
		}
	}
	for( k=1; k <= N; ++k )
		for( i=1; i <= N; ++i )
			if( k != i )
				for( j=1; j <= N; ++j )
					if( k != j && i != j )
						Cost[i][j]=_min( Cost[i][j], Cost[i][k]+Cost[k][j] );
	ofstream out( "royfloyd.out" );
	for( i=1; i <= N; ++i )
	{
		for( j=1; j <= N; ++j )
			out<<( oo == Cost[i][j] ? 0 : Cost[i][j] )<<' ';
		out<<'\n';
	}
	
	return EXIT_SUCCESS;
}