#include<bits/stdc++.h>
using namespace std;
int largestHistogram(int arr[] , int n){

	stack<int> s;
	int max_area=0;
	int area=0;
	int i=0; 
	while(i<n){

		if(s.empty() || arr[s.top()]<=arr[i]){
			//pushing the index
			s.push(i);
			i++;
		}
		else{

			//comuting the area
			

			int curr_max =s.top();
                s.pop();
                int area = arr[curr_max] * (s.empty()?i:(i-s.top()-1) );
                if(area>max_area)
                    max_area=area;	
		}
	}

	while(!s.empty()){
		int curr_max =s.top();
                s.pop();
                
                int area = arr[curr_max] * (s.empty()?i:(i-s.top()-1) );
                if(area>max_area)
                    max_area=area;
	}

	return max_area;
}

int main() {

	int n =0;
	cin>>n;
	int arr[n];
	for(int i =0;i<n;i++)
		cin>>arr[i];

	cout<<largestHistogram(arr , n);	
	return 0;
}