#include <cstdio>
#include <algorithm>
const int INF = 0x3f3f3f3f;
const int NMAX = 105;

int N, D[NMAX][NMAX];

int main() {
	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", &D[i][j]);
			if (D[i][j] == 0) {
				D[i][j] = INF;
			}
		}
	}

	for (int k = 1; k <= N; k++) {
		for (int i = 1; i <= N; i++) {
			for (int j = 1; j <= N; j++) {
				if (i != j) {
					D[i][j] = std::min(D[i][j], D[i][k] + D[k][j]);
				}
			}
		}
	}

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