#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
#define MAX 99999999
int n;
int main()
{
	freopen("royfloyd.in","r",stdin);
	freopen("royfloyd.out","w",stdout);
	scanf("%d",&n);
	vector < vector <int> > a(n+1,vector <int> (n+1,0));
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
			scanf("%d",&a[i][j]);
			a[i][j]=!a[i][j]&&i!=j ? MAX : a[i][j];
		}
	for(int k=1;k<=n;k++)
		for(int i=1;i<=n;i++)
			for(int j=1;j<=n;j++)
				if(i!=k&&j!=k&&i!=j&&a[i][j]>a[i][k]+a[k][j])
					a[i][j]=a[i][k]+a[k][j];
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
			printf("%d ",a[i][j]==MAX ? 0 : a[i][j]);
		printf("\n");
	}
	return 0;
}