#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 100000 + 10;
const int INF = 0x7ffffff;
int n, h[N], c[N], q[N], s, t, j;
int main() {
    freopen("tahort.in", "r", stdin);
    freopen("tahort.out", "w", stdout);
    scanf("%d", &n);
    for(int i=1; i<=n; i++)
        scanf("%d", h+i);
    h[0] = c[j = 1] = q[1] = INF;
    for(int i=1; i<=n; i++) {
        //fprintf(stderr, "%d ", i);
        for(t = i; c[j] < h[i]; j--)
            if(q[j] <= n && h[t] > h[q[j]])
                s = max(s, i - (t = q[j]) + 1);
        j++; q[j] = t, c[j] = h[i];
    } if(s < 2) s = 0;
    printf("%d\n", s);
    return 0;
}