#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
using namespace std;

int n;
int c[101][101];

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", &c[i][j]);
		if (c[i][j] == 0) {
			c[i][j] = 0xffffff;
		}
	}
	
	for (int k = 1; k <= n; k++)
	for (int i = 1; i <= n; i++)
	for (int j = 1; j <= n; j++) {
		if (i != j && i != k && j != k) {
			c[i][j] = min(c[i][j], c[i][k] + c[k][j]);
		}
	}
	
	for (int i = 1; i <= n; i++)
	for (int j = 1; j <= n; j++)
		if (c[i][j] == 0xffffff) {
			c[i][j] = 0;
		}
		
	for (int i = 1; i <= n; i++, printf("%d\n"))
	for (int j = 1; j <= n; j++) printf("%d ", c[i][j]);
	
	
	return 0;
}