#include <stdio.h>
#include <stdlib.h>
int n,dist[30][30];
void printDist()
{
	int i, j;
	for (i = 0; i < n; ++i)
    {
		for (j = 0; j < n; ++j)
			printf("%3d", dist[i][j]);
		printf("\n");
	}
}
void floyd()
{
	int i, j, k;
	for (k = 0; k < n; ++k)
    {
		for (i = 0; i <n; ++i)
			for (j = 0; j <n; ++j)
                //verificam daca i si j sunt  noduri diferite si daca exista drum intre i si k si drum intre k  si j
				if ((dist[i][k] * dist[k][j] != 0) && (i != j))
                    //verificam daca nu putem gasii un drum mai scurt intr i si j
                    //daca il interpunem de k intre ele
					if ((dist[i][k] + dist[k][j] < dist[i][j]) ||(dist[i][j] == 0))
						            dist[i][j] = dist[i][k] + dist[k][j];
	}
	printDist();
}
int main()
{

	freopen("royfloyd.in", "r",stdin);
	freopen("royfloyd.out", "w",stdout);
	scanf( "%d", &n);
	int i, j;
	for (i =0; i <n; ++i)
		for (j =0; j <n; ++j)
			    scanf("%d", &dist[i][j]);

	floyd();
	return 0;
}