#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
//https://www.creativ.xyz/dump-cpp-652/
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
 
// vector
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}
// pair
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
// vector
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// map
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    os << "{";
    repi(itr, map_var) {
        os << *itr;
        itr++;
        if (itr != map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    os << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
 
#define DUMPOUT cerr
 
void dump_func() {
    DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) {
        DUMPOUT << ", ";
    }
    dump_func(std::move(tail)...);
}

#ifdef DEBUG_
#define DEB
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
template <typename T>
struct ruiseki2d{
    vector <vector<int>> s;
    int h,w;
    ruiseki2d(vector <vector<int>> &a){
        h = a.size(), w = a[0].size();
        vector <vector<int>> tmp(h+1,vector <int>(w+1));
        s = tmp;
        rep(i,h)rep(j,h) s[i+1][j+1] = s[i][j+1] + s[i+1][j] - s[i][j] + a[i][j];
    }
    T get(int y1, int x1, int y2, int x2){
        if(y1 > y2) swap(y1,y2);
        if(x1 > x2) swap(x1,x2);
        chmin(y1, h); chmax(y1,0LL);
        chmin(y2, h); chmax(y2,0LL);
        chmin(x1, w); chmax(x1,0LL);
        chmin(x2, w); chmax(x2,0LL);
        return s[y2][x2] - s[y1][x2] - s[y2][x1] + s[y1][x1];
    }
};
signed main(void) { cin.tie(0); ios::sync_with_stdio(false);
    itn n; cin>>n;
    vector <vector<int>> a(n,vector <int>(n));
    rep(i,n){
        rep(j,n){
            cin>>a[i][j];
        }
    }
    
    int ans = -INF;
    struct ruiseki2d <int> r(a);
    dump(r.s);
    rep(i,n+1)rep(j,n+1)rep(k,n+1)rep(l,n+1){
        if(i==k || j==l) continue;
        if(i==k&&j==l) continue;
        //if(r.get(i,j,k,l)==0) cout<<i<<' '<<j<<' '<<k<<' '<<l<<endl;
        chmax(ans, r.get(i,j,k,l));
    }
    cout<<ans<<endl;
}
