#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;

#define PRO "royfloyd"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		freopen("test.out","w",stdout);
	}
}

#define MAX 102
#define INF 0xffffff

int n,bst[MAX][MAX];

void RoyFloyd()
{
	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)
			bst[i][j] = min(bst[i][j], bst[i][k]+bst[k][j]);
}

int main(int argv,char *args[])
{
	OpenFiles(argv==0);
	// start
	int t,a,b,c,d,x,y;
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
			scanf("%d",&bst[i][j]);
			if(bst[i][j]==0)bst[i][j]=INF;
		}
		RoyFloyd();
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n;j++)printf("%d ",bst[i][j]==INF?0:bst[i][j]);
			printf("\n");
		}
		return 0;
}