#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n;
  cin >> n;
  vector<ll> a(n);
  rep(i, n) cin >> a[i];
  if (n == 2) {
    cout << a[0] * a[1] << '\n';
    return;
  }
  ll ans = 0;
  rep(t, 2) {
    vector<ll> suml(n + 1, 0), sumr(n + 1, 0);
    vector<ll> L(n + 1, 0), R(n + 1, 0);
    rep(i, n) {
      suml[i + 1] = max(suml[i] + a[i], 0ll);
      L[i + 1] = max(L[i], suml[i + 1]);
    }
    rep(k, n) {
      ll i = n - k;
      sumr[i - 1] = max(sumr[i] + a[i - 1], 0ll);
      R[i - 1] = max(R[i], sumr[i - 1]);
    }
    ll res = 0;
    rep(i, n) if (i > 0) res = max(res, L[i] * R[i]);
    ans = max(ans, res);
    rep(i, n) a[i] = -a[i];
  }
  cout << ans << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}