#include <bits/stdc++.h>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <typename T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <typename T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct IOST {
	IOST() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(20);
	}
} IOST;

void solve() {
	int n;
	cin >> n;
	vector<ll> a(n);
	rep(i, 0, n) cin >> a[i];
	vector dp(n + 1, vector<ll>(2));
	dp[0] = {(ll)-1e18, (ll)1e18};
	{
		ll mx = 0;
		ll mn = 0;
		rep(i, 0, n) {
			mx = max(a[i], mx + a[i]);
			mn = min(a[i], mn + a[i]);
			dp[i + 1] = dp[i];
			chmax(dp[i + 1][0], mx);
			chmin(dp[i + 1][1], mn);
		}
	}
	vector rdp(n + 1, vector<ll>(2));
	rdp[n] = {(ll)-1e18, (ll)1e18};
	{
		{
			ll mx = 0;
			ll mn = 0;
			for (int i = n - 1; i >= 0; i--) {
				mx = max(a[i], mx + a[i]);
				mn = min(a[i], mn + a[i]);
				rdp[i] = rdp[i + 1];
				chmax(rdp[i][0], mx);
				chmin(rdp[i][1], mn);
			}
		}
	}
	ll ans = -1e18;
	rep(i, 1, n) {
		chmax(ans, dp[i][0] * rdp[i][0]);
		chmax(ans, dp[i][1] * rdp[i][1]);
	}
	cout << ans << "\n";
}

int main() {
	int t = 1;
	// cin >> t;
	rep(i, 0, t) solve();
}