#include <iostream>
using namespace std;
 
int left(int a[],int i,int size)
{
	int k=i-1;
	while(k>=0)
	{
	 if(a[k]>a[i])
	   return k+1;
	 k--;
	}
	return 0;
}
int right(int a[],int i,int size)
{
	int k=i+1;
	while(k<size)
	{
	 if(a[k]>a[i])
	   return k+1;
	 k++;
	}
	return 0;
}
int main() 
{
	int n,max=0,prod;
	cin>>n;
	int arr[n];
	for(int i=0;i<n;i++)
	   cin>>arr[i];
	for(int i=1;i<n-1;i++)
	{
		prod=right(arr,i,n)*left(arr,i,n);
		if(prod>max)
		  max=prod;
	}
	cout<<max;
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IGxlZnQoaW50IGFbXSxpbnQgaSxpbnQgc2l6ZSkKewoJaW50IGs9aS0xOwoJd2hpbGUoaz49MCkKCXsKCSBpZihhW2tdPmFbaV0pCgkgICByZXR1cm4gaysxOwoJIGstLTsKCX0KCXJldHVybiAwOwp9CmludCByaWdodChpbnQgYVtdLGludCBpLGludCBzaXplKQp7CglpbnQgaz1pKzE7Cgl3aGlsZShrPHNpemUpCgl7CgkgaWYoYVtrXT5hW2ldKQoJICAgcmV0dXJuIGsrMTsKCSBrKys7Cgl9CglyZXR1cm4gMDsKfQppbnQgbWFpbigpIAp7CglpbnQgbixtYXg9MCxwcm9kOwoJY2luPj5uOwoJaW50IGFycltuXTsKCWZvcihpbnQgaT0wO2k8bjtpKyspCgkgICBjaW4+PmFycltpXTsKCWZvcihpbnQgaT0xO2k8bi0xO2krKykKCXsKCQlwcm9kPXJpZ2h0KGFycixpLG4pKmxlZnQoYXJyLGksbik7CgkJaWYocHJvZD5tYXgpCgkJICBtYXg9cHJvZDsKCX0KCWNvdXQ8PG1heDsKCXJldHVybiAwOwp9

NQo1IDQgMyA0IDU=

5
5 4 3 4 5