#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
long long n,d[103][103];
int main () {
	freopen("royfloyd.in","r",stdin);
	freopen("royfloyd.out","w",stdout);
	scanf("%lld", &n);
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j) {
			scanf("%lld", &d[i][j]);
		}
		for ( int i =1 ; i <= n; ++i)
			for ( int j = 1; j <= n; ++j)
				if ( d[i][j] == 0)
					d[i][j] = 0x3f3f3f3f;
	for(int k=1;k<=n;++k)
		for(int i=1;i<=n;++i)
			for(int j=1;j<=n;++j)
				if(i!=j && j!=k && i!=k) {
					 if(d[i][j]>d[i][k]+d[k][j] && d[i][j]!=0 && d[i][k]!=0 && d[k][j]!=0)
						d[i][j]=d[i][k]+d[k][j];
				}
	for(int i=1;i<=n;++i) {
		for(int j=1;j<=n;++j)
			if ( d[i][j] != 0x3f3f3f3f)
			printf("%lld ", d[i][j]);
		else
			printf("0 ");
		printf("\n");
	}
	return 0;
}