#include <cstdio>
#include <algorithm>

using namespace std;

int n, c[101][101];

void read () {
	int i, j;
	scanf ("%d", &n);
	for (i=1; i<=n; ++i)
		for (j=1; j<=n; ++j)
			scanf ("%d", &c[i][j]);
}

void solve () {
	int k, i, j;
	for (k=1; k<=n; ++k)
		for (i=1; i<=n; ++i)
			for (j=1; j<=n; ++j)
				c[i][j] = min (c[i][j], c[i][k] + c[k][j]);
}

void write () {
	int i, j;
	for (i=1; i<=n; ++i) {
		for (j=1; j<=n; ++j)
			printf ("%d ", c[i][j]);
		printf ("\n");
	}
}

int main () {
	freopen ("royfloyd.in", "r", stdin);
	read ();
	fclose (stdin);
	solve ();
	freopen ("royfloyd.out", "w", stdout);
	write ();
	fclose (stdout);
	return 0;
}