#include<fstream>
using namespace std;
#define nn 105
int n,a[nn][nn];
int main()
{
	int i,j,k;
	ifstream fin("royfloyd.in");
	fin>>n;
	for(i=1;i<=n;++i)
		for(j=1;j<=n;++j)
			fin>>a[i][j];
	fin.close();
	//rezolvare
	for(k=1;k<=n;++k)//pentru fiecare nod caut daca imbunatateste o distanta
		for(i=1;i<=n;++i)
			for(j=1;j<=n;++j)
				if(i!=j&&(a[i][j]>a[i][k]+a[k][j]||a[i][j]==0)&&a[i][k]&&a[k][j])
					a[i][j]=a[i][k]+a[k][j];
	FILE *f=fopen("royfloyd.out","w");
	for(i=1;i<=n;++i)
	{
		for(j=1;j<=n;++j)
			fprintf(f,"%d ",a[i][j]);
		fprintf(f,"\n");	
	}
	fclose(f);
	return 0;
}