#include<cstdio>
#define OO 1<<30
#define NM 101
#define minim(a,b) (a<b)? (a):(b)
int N,cost[NM][NM];
inline void read()
{
	freopen("royfloyd.in","r",stdin);
	freopen("royfloyd.out","w",stdout);
	scanf("%d",&N);
	for (int i=1; i<=N; ++i)
	{
		for (int j=1; j<=N; ++j)
		{
			scanf("%d",&cost[i][j]);
			if (!cost[i][j])
				cost[i][j]=OO;
		}
	}
	
}
inline void roy()
{
	for (int k=1; k<=N; ++k)
		for (int i=1; i<=N; ++i)
			for (int j=1; j<=N; ++j)
			{
				if (cost[i][k]==OO || cost[k][j]==OO || i==j)
					continue;
				cost[i][j]=minim(cost[i][j],cost[i][k]+cost[k][j]);
			}
}
inline void write()
{
	for (int i=1; i<=N; ++i)
	{
		for (int j=1; j<=N; ++j)
			printf("%d ",(cost[i][j]==OO)? 0:cost[i][j]);
		printf("\n");
	}
}
int main()
{
	read();
	roy();
	write();
	return 0;
}