#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using pii = pair<int,int>;

ll ans = 0;
int f(int l, int r, int ql, int qr, vector<pii> &L, vector<pii> &R){
	if(l == r)
		return 0;
	int mid = (l + r ) / 2;
	int id;
	int mx = 0;
	for(int i = ql; i < qr;i ++){
		int d = (R[i].first + L[mid].first) * abs(L[mid].second - R[i].second);
		if(d > mx){
			mx = d;
			id = i;
		}
	}

	return max(mx, max(f(l, mid, ql, id+1, L, R), f(mid+1, r, id, qr, L, R)));
}
void solve(){
	int n;
	cin >> n;
	vector<int> arr(n);
	for(int &i : arr){
		cin >> i;
	}
	vector<pii> L;
	vector<pii> R;
	for(int i = 0;i < n;i ++){
		if(L.size() == 0 || arr[i] > L.back().first ){
			L.emplace_back(arr[i],i);
		}
	}
	for(int i = 0;i < n;i ++){
		while(R.size() > 0 && arr[i] > R.back().first){
			R.pop_back();
		}
		R.emplace_back(arr[i], i);
	}
	
	cout << f(0,L.size(),0,R.size(),L,R) << "\n";
}

signed main(){
	int t = 1;
	while(t -- ){
		solve();
	}
}