import java.util.Scanner;
public class Main {

	public static void main(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();
	    }
	    scan.close();
	    int cnt=0;
	    int max=0;
	    for(int i=n-2;i>=0;i--) {
	    	if(h[i+1]<=h[i])cnt++;
	    	else cnt=0;
	    	if(cnt>max)max=cnt;
	    }

	    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