#include<bits/stdc++.h>
using namespace std;
signed main(){
int n;
cin >> n;
int a[n];
for(int i=0; i<n; i++){
cin >> a[i];
}
vector<pair<int, int>> p;
for(int i=0; i<n; i++){
p.push_back({a[i], i});
}
p.push_back({-1, n+1});
int ans=0, ans1=0;
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
set<int> idx;
for(int i=0; i<n; i++){
idx.insert(p[i].second);
int cnt=0;
if(idx.count(p[i].second+1)){
cnt++;
}
if(idx.count(p[i].second-1)){
cnt++;
}
if(cnt==0){
ans++;
}
if(cnt==2){
ans--;
}
if(p[i].first!=p[i+1].first and p[i+1].first!=-1){
ans1=max(ans, ans1);
}
}
cout << ans1;
}
