#include<stdio.h>
#include<stdlib.h>
#define SIZE 101

int N, path[SIZE][SIZE];

int main()
{
	int i, j, k;
	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++)
			scanf("%d", &path[i][j]);
	
	// Floyd-Warshall / Roy-Floyd algorithm
	for(k = 1; k <= N; k++)
		for(i = 1; i <= N; i++)
			for(j = 1; j <= N; j++)
				if (path[i][k] && path[k][j] && i != j && (path[i][j] > path[i][k] + path[k][j] || !path[i][j]))
					path[i][j] = path[i][k] + path[k][j];
	
	for(i = 1; i<= N; i++)
	{
		for(j = 1; j <= N; j++)
			printf("%d ", path[i][j]);
		printf("\n");
	}	
	fclose(stdin);
	fclose(stdout);
	return 0;
}