/* dist[0][i][j] = the length of the edge from i to j
	
if ! dist[0][i][j]
		dist[0][i][j] = INFINITY

for k = 1 to N
   for i = 1 to N
      for j = 1 to N
         dist[k][i][j] = min(dist[k-1][i][j], dist[k-1][i][k] + dist[k-1][k][j])
*/
	 
#include<stdio.h>
#define oo 1005
#define dim 105

using namespace std;

int dist[dim][dim][dim],i,j,k,n;

int minim(int a,int b)
{	if(a<b) return a;
	return b;}

int main()
{
	FILE *f=fopen("royfloyd.in","r"), *g=fopen("royfloyd.out","w");
	
fscanf(f,"%d",&n);

for(i=1;i<=n;i++)
	for(j=1;j<=n;j++)
		fscanf(f,"%d",&dist[0][i][j]); //costul muchiei de i la j in graf	
	
for(i=1;i<=n;i++)
	for(j=1;j<=n;j++)
		if(!dist[0][i][j])
			dist[0][i][j]=oo;
		
		
for(k=1;k<=n;k++)		
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)		
		dist[k][i][j]=minim( dist[k-1][i][j], dist[k-1][i][k]+ dist[k-1][k][j]);
		


for(i=1;i<=n;i++)
	{for(j=1;j<=n;j++)
		{if(i==j)
			fprintf(g,"0 ");
		else
		fprintf(g,"%d ",dist[n][i][j]);}
		fprintf(g,"\n");
	}	
	
	
fclose(f);
fclose(g);

return 0;
}