import java.util.Arrays;
import java.util.Scanner;

class Main{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int N=sc.nextInt();
		int[] H=new int[N];
		for(int i=0; i<N; i++) {
			H[i]=sc.nextInt();
		}
		int[] dp=new int[N];
		Arrays.fill(dp, 0);
		if(N==1) {
			p(0);
			System.exit(0);
		}
		else{
			for(int i=N-1; i>=1; i--) {
				if(H[i-1]>=H[i]) {
					dp[i-1]=dp[i]+1;
				}
				else {
					dp[i-1]=0;
				}
			}
			int max=0;
			for(int i=0; i<N; i++) {
				max=Math.max(max, dp[i]);
			}
			p(max);
		}

	}
	public static void p(Object o) {
		System.out.println(o);
	}
}
/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