#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;

int main(){
  int n;
  cin >> n;
  ll h[n];
  rep(i,n) cin >> h[i];
  ll l[n], r[n], st[n];
  ll t = 0;
  rep(i,n) {
    while(t > 0 && h[st[t-1]] >= h[i]) t--;
    l[i] = (t == 0 ? 0 : st[t-1]+1);
    st[t++] = i;
  }
  t = 0;
  for(int i = n-1; i >= 0; i--) {
    while(t > 0 && h[st[t-1]] >= h[i]) t--;
    r[i] = (t == 0 ? n : st[t-1]);
    st[t++] = i; 
  }
  ll ans = 0;
  rep(i,n) ans = max(ans,h[i]*(r[i]-l[i]));
  cout << ans << endl;
  return 0;
}

