/* -*- coding: utf-8 -*-
 *
 * 3129.cc:  No.3129 Multiple of Twin Subarray - yukicoder
 */

#include<cstdio>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 200000;
const int INF = (1U << 31) - 1;
const long long LINF = 1LL << 62;

/* typedef */

using ll = long long;

/* global variables */

int as[MAX_N];
int lxs[MAX_N + 1], rxs[MAX_N + 1], lns[MAX_N + 1], rns[MAX_N + 1];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  lxs[0] = -INF;
  for (int i = 0, s = 0, mns = 0; i < n; i++) {
    s += as[i];
    lxs[i + 1] = max(lxs[i], s - mns);
    mns = min(mns, s);
  }
  //for (int i = 1; i <= n; i++) printf(" %d", lxs[i]); putchar('\n');

  rxs[n] = -INF;
  for (int i = n - 1, s = 0, mns = 0; i >= 0; i--) {
    s += as[i];
    rxs[i] = max(rxs[i + 1], s - mns);
    mns = min(mns, s);
  }
  //for (int i = 0; i < n; i++) printf(" %d", rxs[i]); putchar('\n');

  lns[0] = INF;
  for (int i = 0, s = 0, mxs = 0; i < n; i++) {
    s += as[i];
    lns[i + 1] = min(lns[i], s - mxs);
    mxs = max(mxs, s);
  }
  //for (int i = 1; i <= n; i++) printf(" %d", lns[i]); putchar('\n');

  rns[n] = INF;
  for (int i = n - 1, s = 0, mxs = 0; i >= 0; i--) {
    s += as[i];
    rns[i] = min(rns[i + 1], s - mxs);
    mxs = max(mxs, s);
  }
  //for (int i = 0; i < n; i++) printf(" %d", rns[i]); putchar('\n');

  ll maxp = -LINF;
  for (int i = 1; i < n; i++) {
    ll p0 = (ll)lxs[i] * rxs[i];
    ll p1 = (ll)lxs[i] * rns[i];
    ll p2 = (ll)lns[i] * rxs[i];
    ll p3 = (ll)lns[i] * rns[i];
    maxp = max(maxp, max(max(p0, p1), max(p2, p3)));
  }

  printf("%lld\n", maxp);
  
  return 0;
}