import java.util.*;
class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] h = new int[n];
        int count = 0;
        int max = 0;
        h[0] = sc.nextInt();
        for(int i =1;i<n;i++){
            h[i] = sc.nextInt();
            if(h[i]<=h[i-1]){
                count ++;
            } else {
                max = Math.max(max,count);
                count = 0;
            }
        }
      	max = Math.max(max,count);
        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