#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
int n;
stack<pair<int,int>> st;
vector<int> x, l,r;
 
int main() {
    scanf("%d", &n);
    x.resize(n+5,0); l.resize(n+5,0); r.resize(n+5,0);
    for (int i = 1; i <= n; i++) scanf("%d", &x[i]);
    st.push({0,0});
    for (int i = 1; i <= n; i++) {
        while (st.top().first >= x[i]) st.pop();
        l[i] = st.top().second;
        st.push({x[i],i});
    }
    st = stack<pair<int,int>>();
    st.push({0,n+1});
    for (int i = n; i >= 1; i--) {
        while (st.top().first >= x[i]) st.pop();
        r[i] = st.top().second;
        st.push({x[i],i});
    }
    ll ans = 0;
    for (int i = 1; i <= n; i++)
        ans = max(ans, (ll)(r[i]-l[i]-1)*x[i]);
    printf("%lld", ans);
    return 0;
}