#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define N 100005

long long dpl[N],dpr[N],hei[N],maxn,t;
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF&&n)
    {
        maxn=0;
        for(int i=1;i<=n;i++)
            scanf("%I64d",&hei[i]);
        dpl[1]=1;
        dpr[n]=n;
        for(int i=2;i<=n;i++)   //找当前矩形左边能延伸到的矩形，第几个，下标
        {
            t=i;
            while(t>1&&hei[i]<=hei[t-1])
                t=dpl[t-1];
            dpl[i]=t;
        }
        for(int i=n-1;i;i--)   //找当前矩形右边能够延伸到的矩形，第几个，下标
        {
            t=i;
            while(t<n&&hei[i]<=hei[t+1])
                t=dpr[t+1];
            dpr[i]=t;
        }
        for(int i=1;i<=n;i++)
        {
            long long tot=(dpr[i]-dpl[i]+1)*hei[i];
            if(tot>maxn)
                maxn=tot;
        }
        cout<<maxn<<endl;
    }
    return 0;
}