import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        int n=scanner.nextInt();
        int height[] = new int[n];

        for (int i = 0; i < n; i++)
            height[i]=scanner.nextInt();

        int max=0;
        int heightGreaterCount[] = new int[n];
        heightGreaterCount[n-1] = 0;
        for (int i = n-2; i >= 0; i--) {
            if(height[i]>=height[i+1]) {
                heightGreaterCount[i] = heightGreaterCount[i + 1] + 1;
                max = Math.max(heightGreaterCount[i],max);
            }
        }


        System.out.println(max);
    }
}
/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