import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] h = new int[n];
        if (n == 1) {
            System.out.println(0);
        } else if (n >= 2) {
            int[] len = new int[n - 1];
            for (int i = 0; i < h.length; i++) {
                h[i] = sc.nextInt();
            }
            for (int i = 0; i < len.length; i++) {
                if (h[i] >= h[i + 1]) {
                    len[i] = 1;
                } else {
                    len[i] = 0;
                }
            }
            List<Integer> memory = new ArrayList<>();
            int counter = 0;
            for (int i = 0; i < len.length; i++) {
                if (len[i] == 1) {
                    counter++;
                }
                if (len[i] == 0 || i == len.length - 1) {
                    memory.add(counter);
                    counter = 0;
                }
            }
            int max = memory.get(0);
            for (int i : memory) {
                if (i > max) {
                    max = i;
                }
            }
            System.out.println(max);
        }
        sc.close();
    }
}
/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