/**
我去了。。。用线段树做超时了,用O(N^3)的模版一套竟然给过了。。。还是0MS。。。这是什么情况!!!我晕。。。
╮(╯▽╰)╭。。。看来还是得靠模板拯救世界了。。。
*/
#include <iostream>
#include <cstdio>
using namespace std;
#define MAXN 110
typedef long elem_t;
elem_t maxsum(int m,int n,elem_t mat[][MAXN]){
elem_t matsum[MAXN][MAXN+1],ret,sum;
int i,j,k;
for (i=0;i<m;i++)
for (matsum[i][j=0]=0;j<n;j++)
matsum[i][j+1]=matsum[i][j]+mat[i][j];
for (ret=mat[0][j=0];j<n;j++)
for (k=j;k<n;k++)
for (sum=0,i=0;i<m;i++)
sum=(sum>0?sum:0)+matsum[i][k+1]-matsum[i][j],ret=(sum>ret?sum:ret);
return ret;
}
elem_t maxsum(int m,int n,elem_t mat[][MAXN],int& s1,int& s2,int& e1,int& e2){
elem_t matsum[MAXN][MAXN+1],ret,sum;
int i,j,k,s;
for (i=0;i<m;i++)
for (matsum[i][j=0]=0;j<n;j++)
matsum[i][j+1]=matsum[i][j]+mat[i][j];
for (ret=mat[s1=e1=0][s2=e2=j=0];j<n;j++)
for (k=j;k<n;k++)
for (sum=0,s=i=0;i<m;i++,s=(sum>0?s:i))
if ((sum=(sum>0?sum:0)+matsum[i][k+1]-matsum[i][j])>ret)
ret=sum,s1=s,s2=i,e1=j,e2=k;
return ret;
}
int main()
{
int n;
long a[MAXN][MAXN];
while(~scanf("%d",&n))
{
for(int i = 0;i < n;i++)
for(int j = 0;j< n;j++)
scanf("%ld",&a[i][j]);
printf("%ld\n",maxsum(n,n,a));
}
}