#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define pp pop_back
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define r0 return 0
using namespace std;
const int N = 9 * 1e5 + 5, M = 5005, mod = 1e9 + 7;
int n,m,k;
int a[N],vis[N];
map <int, vector<int>> p;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
p[a[i]].pb(i);
}
sort(a + 1, a + 1 + n);
reverse(a + 1, a + 1 + n);
int cur = 0,ans = 0;
for (int i = 0; i < n; i++) {
cur++;
for (auto to : p[a[i]]) {
int l = to - 1, r = to + 1;
if (vis[l] == 1) cur--;
if (vis[r] == 1) cur--;
vis[to] = 1;
}
ans = max(ans,cur);
}
cout << ans << endl;
return 0;
}
