#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

const int MAX = 101, inf = (1 << 30) - 1;
int n;
int dp[MAX][MAX];

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", &dp[i][j]);
			dp[i][j] = (dp[i][j] ? dp[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) 
					dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
	
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++)
			printf("%d ", (dp[i][j] == inf? 0: dp[i][j]));
		printf("\n");
	}

	return 0;	
}