#include <bits/stdc++.h>
#define db double
#define ll long long
#define int ll
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int, int>
#define vp vector<pii>
#define vip vector<vp>
#define mkp make_pair
#define pb push_back
#define Case(x) cout << "Case #" << x << ": "
using namespace std;
const int INF = 0x3f3f3f3f;
const int P = 998244353;
map<int, pii> mp;
int calc(int id) { return mp[id].second - mp[id].first + 1; }
signed main() {
#ifdef _DEBUG
//	FILE *file = freopen("out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, ans = 0;
    cin >> n;
    vi a(n), id(n);
    vp b(n);
    for (int i = 0; i < n; i++) cin >> a[i], b[i] = { a[i], i };
    sort(b.begin(), b.end());
    int mx = 0, tot = 0;
    for (int i = n - 1, j = n - 1; i >= 0; i = j) {
        while (b[i].first == b[j].first && j >= 0) j--;
        for (int k = i; k > j; k--) {
            int p = b[k].second;
            if (p - 1 >= 0 && id[p - 1]) {
                id[p] = id[p - 1];
                mp[id[p]].second++;
            }
            if (p + 1 < n && id[p + 1]) {
                if (id[p]) {
                    mp[id[p]].second = mp[id[p + 1]].second;
                    mp.erase(id[p + 1]);
                    id[mp[id[p]].second] = id[p];
                } else {
                    id[p] = id[p + 1];
                    mp[id[p]].first--;
                }
            }
            if (!id[p]) {
                id[p] = ++tot;
                mp[id[p]] = { p, p };
            }
            mx = max(mx, calc(id[p]));
        }
        ans = max(ans, mx * b[i].first);
    }
    cout << ans << '\n';
    return 0;
}