#include<stdio.h>

int n, a[1025][1025], i, j, k;
inline int min(int a, int b){
	if (a < b)
		return a;
	return b;
}
int main()
{
	freopen("royfloyd.in", "rt", stdin);
	freopen("royfloyd.out", "wt", stdout);
	
	scanf("%d", &n);
	for (i = 1; i <= n; i ++)
		for (j = 1; j <= n; j ++)
			scanf("%d", &a[i][j]);
	
	for (k = 1; k <= n; k ++)
		for (i = 1; i <= n; i ++)
			for (j = 1; j <= n; j ++)
				if (a[i][k] != 0 && a[k][j] != 0)
					a[i][j] = min(a[i][j], a[i][k] + a[k][j]);

	for (i = 1; i <= n; i ++){
		for (j = 1; j <= n; j ++)
			printf("%d ", a[i][j]);
		printf("\n");
	}
	
	return 0;
}