#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<ll,int>>A(n);
for (int i=0; i<n; i++) {
cin >> A[i].first;
A[i].second = i;
}
if (n == 1) {
cout << 1;
return 0;
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
int ans = 0;
int cnt = 0;
vector<bool>used(n,0);
for (auto &h : A) {
int i = h.second;
if (i+1 < n) {
if (i-1 >= 0) {
if (!used[i-1] && !used[i+1]) ++cnt;
if (used[i-1] && used[i+1]) --cnt;
}
else {
if (!used[i+1]) ++cnt;
}
}
else {
if (!used[i-1]) ++cnt;
}
used[i] = 1;
ans = max(ans,cnt);
}
cout << ans;
}
