#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n,now=0,mx=0;cin>>n;
vector<int> a(n),cmp,ch(n);
vector<vector<int>> idx(n+1);
for(int &x:a) cin>>x;
//compression
cmp=a;
sort(cmp.begin(),cmp.end());
cmp.resize(unique(cmp.begin(),cmp.end())-cmp.begin());
for(int i=0;i<n;i++){
a[i]=upper_bound(cmp.begin(),cmp.end(),a[i])-cmp.begin();
idx[a[i]].push_back(i);
}
for(int i=n-1;i>=0;i--){
for(int x:idx[i+1]){
ch[x]=1;
if((x==0||ch[x-1]==0)&&(x==n-1||ch[x+1]==0)) now++;
else if((x!=0&&ch[x-1]==1)&&(x!=n-1||ch[x+1]==1)) now--;
}
mx=max(mx,now);
}
cout<<mx;
}
