#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
long long n, a[100001], q[100001], sum[100001], f[100001], ans, r;
int main() {
freopen("feel.in","r",stdin);
freopen("feel.out","w",stdout);
scanf("%lld", &n);
for (register int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
n++;
a[n] = 0;
for (register int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + a[i];
while (a[q[r]] > a[i]) {
f[q[r]] += (sum[i - 1] - sum[q[r]]);
r--;
}
f[i] = sum[i] - sum[q[r]];
q[++r] = i;
}
for (register int i = 1; i <= n - 1; i++) {
ans = max(ans, f[i] * a[i]);
}
printf("%lld", ans);
}