#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define _zero(a) memset(a, 0, sizeof(a))
#define endl '\n'
#define int long long
#define mp make_pair
#define x first
#define y second
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define PII pair<int, int>
typedef long long ll;
typedef double dd;
typedef long double ld;
using namespace std;
const int inf = 1e10;
const int M = 998244353;
const ld pi = atan2(0, -1);//arctan(y/x);
const ld eps = 1e-8;
const int maxn = 1e5 + 100;
int r[maxn], l[maxn], h[maxn];
int n;
void get_bound(int bound[maxn])
{
h[0] = -1;
stack<int> st;
st.push(0);
for(int i = 1; i <= n; i++){
while(h[st.top()] >= h[i]) st.pop();
bound[i] = st.top();
st.push(i);
}
}
signed main()
{
IOS;
while(cin >> n && n){
for(int i = 1; i <= n; i++) cin >> h[i];
get_bound(l);
reverse(h + 1, h + 1 + n);
get_bound(r);
int mx = 0;
for(int i = 1, j = n; i <= n; i++, j--){
mx = max(mx, h[i] * (n - l[j] - r[i]));
}
cout << mx << endl;
//for(int i = 1; i <= n; i++) cout << l[i] << " "; cout << endl;
//for(int i = 1; i <= n; i++) cout << r[i] << " "; cout << endl;
}
return 0;
}