import java.util.Scanner;

public class Main {

    void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] H = new int[N];
        for (int i = 0; i < N; i++) {
            H[i] = sc.nextInt();
        }
        int max = 0;
        for (int i = 0; i < N; i++) {
            if (max >= ((N - 1) - i)) {
                break;
            }
            int moveCount = 0;
            for (int j = i; j <= N - 2; j++) {
                if (H[j] >= H[j + 1]) {
                    moveCount++;
                }
                else {
                    break;
                }
            }
            max = Math.max(max, moveCount);
        }
        System.out.print(max);
    }

    // Main
    public static void main(String[] args) {
        new Main().solve();
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz