#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define df double
#define inall(a) for(auto& i:a)cin>>i;
#define outall(a) for(auto i:a)cout<<i<<' ';cout<<endl;
void solve(){
int n;
cin>>n;
ll a[n];
inall(a);
priority_queue<pair<int,int>>pq;
for(int i=0;i<n;i++){
pq.push({a[i],i});
}
int ans=0;
int curcount=0;
while(!pq.empty()){
int curheight=pq.top().first;
vector<int>v;
while(!pq.empty()&&pq.top().first==curheight){
v.push_back(pq.top().second);
pq.pop();
}
for(auto x:v){
curcount++;
if(x!=0&&a[x-1]>=curheight)curcount--;
if(x!=n-1&&a[x+1]>curheight)curcount--;
}
ans=max(ans,curcount);
}
cout<<ans<<endl;
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
int t=1;
//cin>>t;
while(t--)solve();
}
