#include<stdio.h>
#include<stack>
#define N 100005
using namespace std;
int n,a[N];
int main()
{
	freopen(".14.in","r",stdin);
	freopen(".14.out","w",stdout);
	int i;
		long long dap=0;
		stack<int> S;
		S.push(0);
		a[0]=0;
		scanf("%d",&n);
		for(i=1;i<=n+1;i++)
		{
			if(i<=n) scanf("%d",&a[i]);
			else a[i]=0;
			while(a[S.top()]>a[i])
			{
				int t=S.top();
				S.pop();
				if(dap<(long long)(i-S.top()-1)*a[t]) dap = (long long)(i-S.top()-1)*a[t];
			}
			S.push(i);
		}
		printf("%lld\n",dap);
	
}