#include<fstream>
#include<algorithm>
#include<queue>
#define inf 1<<30
using namespace std;
int n,i,j,d[101][101],x,y;
struct dijk
{
	int nod,cost;
};
vector<dijk> a[101];
queue<int>q;
inline void bf(int x1)
{
	int i,x;
	q.push(x1);
	while(!q.empty())
	{
		x=q.front();
		q.pop();
	for(i=0;i<a[x].size();++i)
		if(d[x1][a[x][i].nod]>d[x1][x]+a[x][i].cost)
		{
			d[x1][a[x][i].nod]=d[x1][x]+a[x][i].cost;
			q.push(a[x][i].nod);
		}
	}
}

int main()
{
	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)
		{
			d[i][j]=inf;
			scanf("%d",&x);
			if(x!=0)
			a[i].push_back((dijk){j,x});
		}
		
		for(i=1;i<=n;++i)
		{
			d[i][i]=0;
			bf(i);
		}
		

		for(i=1;i<=n;++i)
		{
			for(j=1;j<=n;++j)
				if(d[i][j]!=inf)
				printf("%d ",d[i][j]);
				else
					printf("0 ");
			printf("\n");
		}
		return 0;
}