1 /******************************
 2 code by drizzle
 3 blog: www.cnblogs.com/hsd-/
 4 ^ ^    ^ ^
 5  O      O
 6 ******************************/
 7 //#include<bits/stdc++.h>
 8 #include<iostream>
 9 #include<cstring>
10 #include<cmath>
11 #include<cstdio>
12 #define ll long long
13 #define mod 1000000007
14 #define PI acos(-1.0)
15 using namespace std;
16 int main()
17 {
18     int a[105][105];
19     int b[105];
20     int n;
21     while(scanf("%d",&n)!=EOF)
22     {
23         for(int i=1;i<=n;i++)
24         {
25             for(int j=1;j<=n;j++)
26                 scanf("%d",&a[i][j]);
27         }
28         int maxn=-100000;
29         for(int i=1;i<=n;i++)
30         {
31             memset(b,0,sizeof(b));
32             for(int j=i;j<=n;j++)
33             {
34                 int sum=0;
35                 for(int k=1;k<=n;k++)
36                 {
37                     b[k]+=a[j][k];
38                     sum+=b[k];
39                     if(sum<0) sum=b[k];
40                     if(sum>maxn) maxn=sum;
41                 }
42             }
43         }
44         printf("%d\n",maxn);
45     }
46     return 0;
47 }