#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct pt
{
	int v[905][905];
	pt(){memset(v,0x3f,sizeof(v));}
}f[45],g[45];
int n,sn;
int mn1=1,mn2=1;
pt operator*(const pt &x,const pt &y)
{
	pt z;
	for(int i=1;i<=n;i++)
		for(int j=mn1;j<=n;j++)
		{
			int u=(i+j-1)%n+1,k,*p=z.v[i],val=x.v[i][j];
			const int *q=y.v[u];
			for(k=mn2;j+k+3<=n;k+=4)
			{
			/*	z.v[i][j+k]=min(z.v[i][j+k],x.v[i][j]+y.v[u][k]);
				z.v[i][j+k+1]=min(z.v[i][j+k+1],x.v[i][j]+y.v[u][k+1]);
				z.v[i][j+k+2]=min(z.v[i][j+k+2],x.v[i][j]+y.v[u][k+2]);
				z.v[i][j+k+3]=min(z.v[i][j+k+3],x.v[i][j]+y.v[u][k+3]);*/
				p[j+k]=min(p[j+k],val+q[k]);
				p[j+k+1]=min(p[j+k+1],val+q[k+1]);
				p[j+k+2]=min(p[j+k+2],val+q[k+2]);
				p[j+k+3]=min(p[j+k+3],val+q[k+3]);
			}
		/*	if(j+k<=n) z.v[i][j+k]=min(z.v[i][j+k],x.v[i][j]+y.v[u][k]);
			if(j+k+1<=n) z.v[i][j+k+1]=min(z.v[i][j+k+1],x.v[i][j]+y.v[u][k+1]);
			if(j+k+2<=n) z.v[i][j+k+2]=min(z.v[i][j+k+2],x.v[i][j]+y.v[u][k+2]);
			if(j+k+3<=n) z.v[i][j+k+3]=min(z.v[i][j+k+3],x.v[i][j]+y.v[u][k+3]);*/
			if(j+k<=n) p[j+k]=min(p[j+k],val+q[k]);
			if(j+k+1<=n) p[j+k+1]=min(p[j+k+1],val+q[k+1]);
			if(j+k+2<=n) p[j+k+2]=min(p[j+k+2],val+q[k+2]);
			if(j+k+3<=n) p[j+k+3]=min(p[j+k+3],val+q[k+3]);
		}
//	printf("---\n");
	return z;
}
int solve(const pt &x,const pt &y)
{
	int ans=1e9;
//	for(int i=1;i<=n;i++)
//		for(int j=1;j<=n;j++)
//			printf("i=%d,j=%d,y=%d\n",i,j,y.v[i][j]);
	if(y.v[1][n]>1e9)
	{
		for(int i=1;i<=n;i++)
		{
			ans=min(ans,x.v[i][n]);
		//	ans=min(ans,y.v[i][n]);
	//		printf("i=%d,x=%d,y=%d,ans=%d\n",i,x.v[i][n],y.v[i][n],ans);
		}
		return ans;
	}
	for(int i=1;i<=n;i++)
		for(int j=1;j<n;j++)
		{
			int u=(i+j-1)%n+1;
			ans=min(ans,x.v[i][j]+y.v[u][n-j]);
		//	printf("i=%d,j=%d,u=%d,ans=%d,x=%d,y=%d\n",i,j,u,ans,x.v[i][j],y.v[u][n-j]);
		}
	return ans;
}
int main()
{
//	freopen("A.in","r",stdin);
	scanf("%d",&n);
	sn=1;
	while(1ll*(sn+1)*(sn+1)<=n) sn++;
	sn++;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			scanf("%d",&f[1].v[i][j]);
	for(int i=2;i<=sn;i++)
		f[i]=f[i-1]*f[1];
	g[1]=f[sn];
	for(int i=2;i<=sn;i++)
	{
		mn1=(i-1)*sn,mn2=sn;
		g[i]=g[i-1]*g[1];
	}
	for(int i=1;i<=n;i++)
		printf("%d ",solve(f[(i-1)%sn+1],g[(i-1)/sn]));
	printf("\n");
	return 0;
}