import java.util.*;
import java.math.BigInteger;

public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        //String str = sc.next();
        int N = sc.nextInt();
        int[] h = new int[N];
        int count = 0;
        int max = 0;
        
        for(int i=0; i<N; i++){
            h[i] = sc.nextInt();
            if(i>0){
                if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                }
            }
        }
        
        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