import java.util.*;

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