import java.util.*;
public class Main {
  public static void main(String[] args) {
    Scanner scan = new Scanner(System.in);
    int N = scan.nextInt();
    int[] H = new int[N+1]; 
     for (int i=1;i<N+1;i++){
       H[i]= scan.nextInt();
     }
    
    int count =0;
    int best=0;
    for (int j=	1;j<N;j++){
     if(H[j]>=H[j+1]) {
       count ++;
     }else{
       if(best<count) best=count;
       count =0;
     }
    }
    if(best<count) best=count;
  
    System.out.println(best);
  
  }
 
}
/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