#include <iostream>
#include <cstdio>
#include <fstream>
#include <set>
#include <vector>
#include <list>
#include <queue>
#include <algorithm>
#include <stack>

#define inf 20000000

using namespace std;

int n, m, k, adj[101][101];

int main()
{
	int i, j, a, b, c;
	freopen("royfloyd.in", "r", stdin);
	freopen("royfloyd.out", "w", stdout);
	scanf("%d", &n);
	for (i = 1; i <= n; i++)
		for (j = 1; j <= n; j++)
			if (i != j) adj[i][j] = inf;
	for (i = 1; i <= n; i++)
		for (j = 1; j <= n; j++)
			scanf("%d ", &c), adj[i][j] = c;
	for (k = 1; k <= n; k++)
		for (i = 1; i <= n; i++)
			for (j = 1; j <= n; j++)
				if (adj[i][k] && adj[k][j] && (adj[i][j] > adj[i][k] + adj[k][j] || !adj[i][j]) && i != j)
					adj[i][j] = adj[i][k] + adj[k][j];
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= n; j++)
			printf("%d ", adj[i][j]);
		printf("\n");
	}

	return 0;
}