#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int num;
cin>>num;
int high[num];
int area[num];
for(int i=0; i<num; i++)
{
cin>>high[i];
}
int width;
for(int i=0; i<num; i++)
{
width=1;
int m=i-1;
while(m>=0)
{
if(high[m]<high[i])
{
break;
}
width++;
m--;
}
int n=i+1;
while(n!=num)
{
if(high[n]<high[i])
{
break;
}
width++;
n++;
}
area[i]=high[i]*width;
}
int maxarea=0;
for(int i=0; i<num; i++)
{
if(area[i]>maxarea)
{
maxarea = area[i];
}
}
cout<<maxarea;
}
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1010;
int n;
int h[N];
int main()
{
cin>>n;
for(int i=1;i<=n;i++) cin>>h[i];
int res=0;
for(int i=1;i<=n;i++)
{
int l = i,r = i;
while(l>=1&&h[l]>=h[i]) l--;
while(r<=n&&h[r]>=h[i]) r++;
res = max(res,h[i]*(r-l-1));
}
cout<<res<<endl;
return 0;
}