#include<bits/stdc++.h>
using namespace std;
long long n,a[1005],la[1005],ra[1005],ans=INT_MIN;

int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    for(int i=1;i<=n;i++){
    	int l=i,r=i;
    	while(l>1&&a[l-1]>=a[i]) l--;
    	la[i]=l;
    	while(r<n-1&&a[r+1]>=a[i]) r++;
		ra[i]=r;
    	ans=max(ans,a[i]*(ra[i]-la[i]+1));
	}
	printf("%d",ans);
    return 0;
}
/**************************************************************
	Problem: 1773
	User: yanye
	Language: C++
	Result: Accepted
	Time:4 ms
	Memory:2100 kb
****************************************************************/