#include <stdio.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <string.h>

#define NMAX 101
#define INF 9999999

using namespace std;
int d[NMAX][NMAX];

int main() {
	FILE *in, *out;
	in = fopen("royfloyd.in", "r");
	out = fopen("royfloyd.out", "w");
	int n;
	fscanf(in, "%d", &n);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			fscanf(in, "%d", &d[i][j]);
		}
	}

	for (int k = 1; k <= n; ++k) {
		for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= n; ++j) {
				if (d[i][k] && d[k][j] && (d[i][j] > d[i][k] + d[k][j] || !d[i][j]) && i != j) {
					d[i][j] = d[i][k] + d[k][j];
				}
			}
		}
	}

	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			fprintf(out, "%d ", d[i][j]);
		}
		fprintf(out, "\n");
	}

	
	return 0;
}