#include <iostream>
using namespace std;
const int N = 1e5 + 10;
int n;
int a[N];
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i ++ ) scanf("%d", &a[i]);
int res = 0;
for (int i = 0, j = n - 1; i < j;) //双指针首尾逼近遍历,直到两指针相遇
{
res = max(res, (j - i) * min(a[i], a[j]));
if (a[i] < a[j]) i ++ ; //右边高,则右指针不动,左指针往右靠
else j -- ; //反之亦然
}
printf("%d\n", res);
return 0;
}