#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5;
long long l [N + N];
int main(){
int n;
long long maxlen = 0, curlen = 0;
cin >> n;
for(int i=0;i<n;i++){
cin >> l[i];
l[i+n] = l[i];
}
for(int i=1;i<2*n;i++){
if(l[i-1] > l[i]) curlen ++;
else curlen = 1;
maxlen = max(maxlen, curlen);
}
cout << maxlen;
}