#include <bits/stdc++.h>
#define DB double
#define LL long long

#define MST(a, b) memset((a), (b), sizeof(a))

#ifdef _DEBUG_
#define MRK() cout << "Mark" << endl;
#define WRT(x) cout << #x << " = " << (x) << endl;
#else
#define MRK() ;
#define WRT(x) ;
#endif

#define MAXN 10100000
#define MAXM 2010000
#define MOD 998244353  // 1000000007
#define INF 0x3f3f3f3f
#define LLINF 0x3f3f3f3f3f3f3f3f
#define EPS 1e-5

#define _ 0
using namespace std;

namespace IO {
const int MT = 40 * 1024 * 1024;  /// 40MB 请注意输入数据的大小！！！
char buf[MT];
int ptr, sz;
/// 要记得把这一行添加到main函数第一行！！！
void begin() {
    ptr = 0;
    sz = fread(buf, 1, MT, stdin);
}
template <typename T>
inline bool scan_d(T& t) {
    while (ptr < sz && buf[ptr] != '-' && (buf[ptr] < '0' || buf[ptr] > '9')) ptr++;
    if (ptr >= sz)
        return false;
    bool sgn = false;
    if (buf[ptr] == '-')
        sgn = true, ptr++;
    for (t = 0; ptr < sz && '0' <= buf[ptr] && buf[ptr] <= '9'; ptr++) t = t * 10 + buf[ptr] - '0';
    if (sgn)
        t = -t;
    return true;
}
inline bool scan_s(char s[]) {
    while (ptr < sz && (buf[ptr] == ' ' || buf[ptr] == '\n')) ptr++;
    if (ptr >= sz)
        return false;
    int len = 0;
    while (ptr < sz && buf[ptr] != ' ' && buf[ptr] != '\n') s[len++] = buf[ptr], ptr++;
    s[len] = '\0';
    return true;
}
template <typename T>
void print(T x) {
    static char s[33], *s1;
    s1 = s;
    if (!x)
        *s1++ = '0';
    if (x < 0)
        putchar('-'), x = -x;
    while (x) *s1++ = (x % 10 + '0'), x /= 10;
    while (s1-- != s) putchar(*s1);
}
template <typename T>
void println(T x) {
    print(x);
    putchar('\n');
}
};  // namespace IO

void init() {}

void work() {}
int q1[MAXN], q2[MAXN];

int main() {
    int n;
    IO::begin();
    IO::scan_d(n);
    q1[0] = -1;
    q2[0] = 0;
    LL ans = 0;
    int ptr = 0, x;
    for (int i = 1; i <= n; i++) {
        IO::scan_d(x);
        while (x < q1[ptr]) {
            // cout<<q1[ptr]<<' '<<i<<' '<<q2[ptr-1]<<endl;
            ans = max(ans, (LL)q1[ptr] * (i - q2[ptr - 1] - 1));
            ptr--;
        }
        q1[++ptr] = x;
        q2[ptr] = i;
    }
    while (ptr) {
        ans = max(ans, (LL)q1[ptr] * (n - q2[ptr] + 1));
        ptr--;
    }
    cout << ans << endl;
    return ~~(0 ^ _ ^ 0);
}