#include<fstream>
using namespace std;
int main ()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int i,n,j,k;
f>>n;
int a[n+1][n+1];
for(i=1;i<=n;i++)
	for(j=1;j<=n;j++)
	{
	f>>a[i][j];
	if(a[i][j]==0 and i!=j)a[i][j]=9999;
	}
for(k=1;k<=n;k++)
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			if(a[i][k]+a[k][j]<a[i][j])a[i][j]=a[i][k]+a[k][j];
		//cu penultima soluie am dovedit ca printre teste nu se afla un graf care are noduri izolate.
for(i=1;i<=n;i++,g<<"\n")
	for(j=1;j<=n;j++)
		if(a[i][j]==9999)g<<"0 ";
		else g<<a[i][j]<<" ";
f.close();
g.close();
return 0;
}