#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n);
  rep(i, n) cin >> a[i];
  VL dp1f(n+1), dp2f(n+1), dp1b(n+1), dp2b(n+1);
  constexpr long long INF = 1002003004005006007;
  rep(_, 2) {
    ll mn = 0, mx = 0, s = 0;
    dp1f[0] = INF, dp2f[0] = -INF;
    rep(i, n) {
      s += a[i];
      dp1f[i+1] = min(dp1f[i], s - mx);
      dp2f[i+1] = max(dp2f[i], s - mn);
      chmin(mn, s);
      chmax(mx, s);
    }
    swap(dp1f, dp1b);
    swap(dp2f, dp2b);
    reverse(all(a));
  }
  ll ans = -INF;
  for (int i = 1; i < n; i++) {
    chmax(ans, dp1f[i] * dp1b[n-i]);
    chmax(ans, dp2f[i] * dp2b[n-i]);
  }
  cout << ans << '\n';
}