#include<iostream>
using namespace std;
int weight[10010];
int milk1[10010];
int milk2[10010];
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>weight[i];
}
int former,latter;
//处理左侧熊猫
milk1[0]=200;
for(int i=1;i<n;i++){
former=i-1;
if(weight[i]>weight[former]){
milk1[i]=milk1[former]+100;
}else if(weight[i]==weight[former]){
milk1[i]=milk1[former];
}else{
milk1[i]=200;
}
}
//处理右侧熊猫
milk2[n-1]=200;
for(int i=n-2;i>=0;i--){
latter=i+1;
if(weight[i]>weight[latter]&&milk2[i]<milk2[latter]){
milk2[i]=milk2[latter]+100;
}else if(weight[i]==weight[latter]){
milk2[i]=milk2[latter];
}else{
milk2[i]=200;
}
}
//输出
long int sum=0;
for(int i=0;i<n;i++){
sum+=max(milk1[i],milk2[i]);
}
cout<<sum;
return 0;
}