// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n; cin >> n;

    vector<int> t(n);

    for (int i = 0; i < n; i++) {
        cin >> t[i];
    }

    int biggest = 0;

    for (int i = 0; i < n-1; i++) {
        int current = i+1;
        int last = 0;
        if (t[i] > t[i+1]) {
            for (int j = i+1; j < n && t[j] < t[i]; j++) {
                last = j+1;
                
            }
            last++;

            biggest = max(biggest, last-current);
        }

    }

    cout << biggest;
}