#include <cstdio>
#include <algorithm>

using namespace std;

const int INF = 0x3f3f3f3f;

int main(void) {
	freopen("royfloyd.in", "rt", stdin);
	freopen("royfloyd.out", "wt", stdout);
	int N;

	scanf(" %d", &N);

	int A[N][N];
	int i, j, k;

	for (i = 0; i < N; ++i)
		for (j = 0; j < N; ++j) {
			scanf(" %d", A[i] + j);
			if (A[i][j] == 0 && i != j)
				A[i][j] = INF;
		}
	
	for (k = 0; k < N; ++k)
		for (i = 0; i < N; ++i)
			for (j = 0; j < N; ++j)
				A[i][j] = min(A[i][j], A[i][k] + A[k][j]);
	
	for (i = 0; i < N; ++i) {
		for (j = 0; j < N; ++j)
			printf("%d ", A[i][j]);
		printf("\n");
	}

	return 0;
}