#include <cstdio>

const int N = 102;
const int INF = 2000000000;

int n;
int d[N][N];

inline int min(int a, int b)
{
	return (a<b)?a:b;
}

void citire()
{
	scanf("%d",&n);
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
		{
			scanf("%d",&d[i][j]);
			if (i != j && d[i][j] == 0)
				d[i][j] = INF;
		}
}

void roy_floyd()
{
	for (int k = 1; k <= n; ++k)
		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= n; ++j)
				d[i][j] = min(d[i][j], (d[i][k] == INF || d[k][j] == INF)?INF:d[i][k] + d[k][j]);
}

void scriere()
{
	for (int i = 1; i <= n; ++i)
	{
		for (int j = 1; j <= n; ++j)
			printf("%i ",d[i][j]!=INF?d[i][j]:0);
		printf("\n");
	}
}

int main()
{
	freopen("royfloyd.in","r",stdin);
	freopen("royfloyd.out","w",stdout);
	citire();
	roy_floyd();
	scriere();
	return 0;
}