// 一刀両断！すると、先頭と末尾から見ていけばいいねとなる。
#include <iostream>
#include <algorithm>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
#define rrep(i, n) for(i = n - 1; i >= 0; i--)
using namespace std;

const int INF1 = (1LL << 31);
const int INF2 = (1LL << 62);
int n;
int a[200000];
int ra[200001];
int ls[200001], ls2[200001];
int rs[200001], rs2[200001];

signed main() {
	int i;

	cin >> n;
	rep(i, n) cin >> a[i];
	rep(i, n) ra[i + 1] = ra[i] + a[i];

	int val = ra[0];
	ls[0] = -INF1;
	for (i = 1; i <= n; i++) {
		ls[i] = max(ls[i - 1], ra[i] - val);
		val = min(val, ra[i]);
	}

	val = ra[0];
	ls2[0] = INF1;
	for (i = 1; i <= n; i++) {
		ls2[i] = min(ls2[i - 1], ra[i] - val);
		val = max(val, ra[i]);
	}

	val = ra[n];
	rs[n] = -INF1;
	for (i = n - 1; i >= 0; i--) {
		rs[i] = max(rs[i + 1], val - ra[i]);
		val = max(val, ra[i]);
	}

	val = ra[n];
	rs2[n] = INF1;
	for (i = n - 1; i >= 0; i--) {
		rs2[i] = min(rs2[i + 1], val - ra[i]);
		val = min(val, ra[i]);
	}

	int ans = -INF2;
	for (i = 1; i < n; i++) {
		ans = max(ans, ls[i] * rs[i]);
		ans = max(ans, ls[i] * rs2[i]);
		ans = max(ans, ls2[i] * rs[i]);
		ans = max(ans, ls2[i] * rs2[i]);
	}

	cout << ans << endl;
	return 0;
}