#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
inline double distance(double y1, double x1, double y2, double x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }

const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy = { 0, 1, 0, -1 }, dx = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）

using namespace std;

class CumulativeSum {

public:
    vector<int> memo1;          // 1次元用の累積和表
    vector<vector<int>> memo2;  // 2次元用の累積和表

    CumulativeSum(const vector<int> &line) {
        this->memo1.resize(line.size() + 1, 0);

        for (int i = 0; i < line.size(); ++i) {
            this->memo1[i + 1] = this->memo1[i] + line[i];
        }
    }

    // 2次元の累積和表を作成
    CumulativeSum(const vector<vector<int>> &board) {
        int height = board.size();
        int width = board[0].size();
        this->memo2 = vector<vector<int>>(height + 1, vector<int>(width + 1, 0));

        for (int y = 0; y < height; ++y) {
            for (int x = 0; x < width; ++x) {
                memo2[y + 1][x + 1] = board[y][x] + memo2[y + 1][x];
            }
            for (int x = 0; x < width; ++x) {
                memo2[y + 1][x + 1] += memo2[y][x + 1];
            }
        }
    }

    int sum(int left, int right) {
        return this->memo1[right] - this->memo1[left];
    }

    /*
    (y1, x1)から(y2, x2)の合計を返す．(y2, x2)は含まない
    座標はmemoを作成したboard準拠
    (ex, sum(0, 0, 2, 2)なら(0, 0), (0, 1), (1, 0), (1, 1)の合計を返す)
    */
    int sum(int y1, int x1, int y2, int x2) {
        return this->memo2[y2][x2] - this->memo2[y2][x1] - this->memo2[y1][x2] + this->memo2[y1][x1];
    }

};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;

    VV<int> field(N, V<int>(N, 0));
    FOR(i, 0, N) {
        FOR(j, 0, N) {
            cin >> field[i][j];
        }
    }

    VV<int> total(N, V<int>(N + 1, 0));
    FOR(y, 0, N) {
        FOR(x, 0, N) {
            total[y][x + 1] = total[y][x] + field[y][x];
        }
    }

    int ans = -INT_MAX;
    FOR(left, 0, N + 1) {
        FOR(right, left + 1, N + 1) {

            int t = 0;
            FOR(y, 0, N) {
                int num = total[y][right] - total[y][left];
                if (t < 0) {
                    t = num;
                }
                else {
                    t += num;
                }
                ans = max(ans, t);
            }
        }
    }
    print(ans);

    return 0;
}


Measured memory_bytes: 3348