#include <bits/stdc++.h>
using namespace std;

#define rep(i, l, r) for (int i = (int)(l); i<(int)(r); i++)
#define ll long long

int main() {
    int N; cin >> N;
    vector<int> A(N+2);
    rep(i, 1, N+1) cin >> A[i];
    vector<ll> LS(N+2), RS(N+2);
    LS[0] = 0; RS[N+1] = 0;
    for (int i = 1; i <= N; i++) LS[i] = LS[i-1] + A[i];
    for (int i = N; i >= 1; i--) RS[i] = RS[i+1] + A[i];
    vector<ll> LSMax(N+2), LSMin(N+2);
    LSMax[0] = LS[0]; LSMin[0] = LS[0];
    for (int i = 1; i <= N; i++) {
        LSMax[i] = max(LSMax[i-1], LS[i]);
        LSMin[i] = min(LSMin[i-1], LS[i]);
    }
    vector<ll> RSMax(N+2), RSMin(N+2);
    RSMax[N+1] = RS[N+1]; RSMin[N+1] = RS[N+1];
    for (int i = N; i >= 1; i--) {
        RSMax[i] = max(RSMax[i+1], RS[i]);
        RSMin[i] = min(RSMin[i+1], RS[i]);
    }

    vector<ll> RRangeMax(N+2), RRangeMin(N+2);
    for (int i = N; i >= 1; i--) {
        RRangeMax[i] = RS[i] - RSMin[i+1];
        RRangeMin[i] = RS[i] - RSMax[i+1];
    }
    for (int i = N-1; i >= 1; i--) {
        RRangeMax[i] = max(RRangeMax[i], RRangeMax[i+1]);
        RRangeMin[i] = min(RRangeMin[i], RRangeMin[i+1]);
    }

    ll ans = -4e18;

    for (int i = 1; i <= N-1; i++) {
        rep(j, 0, 4) {
            ll l, r;
            if (j&1) l = LS[i] - LSMin[i-1];
            else l = LS[i] - LSMax[i-1];
            if (j&2) r = RRangeMax[i+1];
            else r = RRangeMin[i+1];
            ans = max(ans, l * r);
        }
    }
    cout << ans << endl;
}