#include<cstdio>
void read(),solve();
int i,N,j,k,m[110][110];
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	freopen("royfloyd.in","r",stdin);
	freopen("royfloyd.out","w",stdout);
	scanf("%d",&N);
	for(i=1;i<=N;i++)
		for(j=1;j<=N;j++)
			scanf("%d",&m[i][j]);
}
void solve()
{
	for(k=1;k<=N;k++)
		for(i=1;i<=N;i++)
			for(j=1;j<=N;j++)
			{
				if(i==j)continue;
				if(m[i][j]>m[i][k]+m[k][j] || !m[i][j])m[i][j]=m[i][k]+m[k][j];
			}
	for(i=1;i<=N;i++)
	{
		for(j=1;j<=N;j++)
			printf("%d ",m[i][j]);
	    printf("\n");
	}
}