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);
	}
	
	} import java.util.*; util.* java 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);
	}
	
	} 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);
	} main {
		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);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc long[] h = new long[n]; h new long[n] n for(int i = 0; i < n; i++){
			h[i] = sc.nextLong();
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			h[i] = sc.nextLong();
		} {
			h[i] = sc.nextLong();
		} h[i] = sc.nextLong() h[i] h i sc.nextLong() sc.nextLong sc long max = 0 max 0 count = 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;
			}
		} int i = 0; int i = 0; i 0 i < n-1 i n-1 n 1 i++ i++ i {
			
			if(h[i] >= h[i+1]){
				count += 1;
			}else{
				count = 0;
			}
			if(max < count){
				max = count;
			}
		} {
			
			if(h[i] >= h[i+1]){
				count += 1;
			}else{
				count = 0;
			}
			if(max < count){
				max = count;
			}
		} if(h[i] >= h[i+1]){
				count += 1;
			}else{
				count = 0;
			} h[i] >= h[i+1] h[i] h i h[i+1] h i+1 i 1 {
				count += 1;
			} count += 1 count 1 {
				count = 0;
			} count = 0 count 0 if(max < count){
				max = count;
			} max < count max count {
				max = count;
			} max = count max count System.out.println(max) System.out.println System.out System System.out max String[] args args
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);
	}
	
	}