#include<bits/stdc++.h>
using namespace std;
const int N = 5e5+5;
int a[N],q[10005],sum,maxm;
int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i ++ ){
        cin >>a[i];
        if(a[i]>a[i-1]){
            q[a[i-1]+1]++;
            q[a[i]+1]--;
        }
    }
    for (int i = 1; i <= 10004; i ++ ){
        sum+=q[i];
        maxm=max(maxm,sum);
    }
    cout << maxm;
    return 0;
}