import java.util.Scanner;

class Main {
    public static void main(final String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] h = new int[n];
        for (int i = 0; i< n; i++) {
            h[i] = scan.nextInt();
        }
        int ans = 0;
        int len = 0;
        for (int i = 0; i< n-1; i++) {
            if (h[i] >= h[i+1]) {
                len++;
            } else {
                ans = Math.max(ans, len);
                len = 0;
            }
        }
        ans = Math.max(ans, len);

        System.out.println(ans);
    }

}
/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