import java.util.*;
public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
 		int num = sc.nextInt();
      	
      	int height[] = new int[num];
      	int kouho[] = new int[num];
      	int maximum = 0;
      	int maximum_kouho = 0;
      	height[0]=sc.nextInt();
      	for(int i=1;i<num;i++){
        	height[i] = sc.nextInt();
          	if(height[i]<=height[i-1]){ 
              maximum_kouho=maximum_kouho+1;
            }else{
              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
                maximum_kouho = 0;
            }
        }
      	              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
		
      	
		System.out.println(maximum);
	}
} import java.util.*; util.* java public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
 		int num = sc.nextInt();
      	
      	int height[] = new int[num];
      	int kouho[] = new int[num];
      	int maximum = 0;
      	int maximum_kouho = 0;
      	height[0]=sc.nextInt();
      	for(int i=1;i<num;i++){
        	height[i] = sc.nextInt();
          	if(height[i]<=height[i-1]){ 
              maximum_kouho=maximum_kouho+1;
            }else{
              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
                maximum_kouho = 0;
            }
        }
      	              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
		
      	
		System.out.println(maximum);
	}
} Main public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
 		int num = sc.nextInt();
      	
      	int height[] = new int[num];
      	int kouho[] = new int[num];
      	int maximum = 0;
      	int maximum_kouho = 0;
      	height[0]=sc.nextInt();
      	for(int i=1;i<num;i++){
        	height[i] = sc.nextInt();
          	if(height[i]<=height[i-1]){ 
              maximum_kouho=maximum_kouho+1;
            }else{
              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
                maximum_kouho = 0;
            }
        }
      	              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
		
      	
		System.out.println(maximum);
	} main {
		Scanner sc = new Scanner(System.in);
 		int num = sc.nextInt();
      	
      	int height[] = new int[num];
      	int kouho[] = new int[num];
      	int maximum = 0;
      	int maximum_kouho = 0;
      	height[0]=sc.nextInt();
      	for(int i=1;i<num;i++){
        	height[i] = sc.nextInt();
          	if(height[i]<=height[i-1]){ 
              maximum_kouho=maximum_kouho+1;
            }else{
              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
                maximum_kouho = 0;
            }
        }
      	              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
		
      	
		System.out.println(maximum);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int num = sc.nextInt(); num sc.nextInt() sc.nextInt sc int height[] = new int[num]; height new int[num] num int kouho[] = new int[num]; kouho new int[num] num int maximum = 0; maximum 0 int maximum_kouho = 0; maximum_kouho 0 height[0]=sc.nextInt() height[0] height 0 sc.nextInt() sc.nextInt sc for(int i=1;i<num;i++){
        	height[i] = sc.nextInt();
          	if(height[i]<=height[i-1]){ 
              maximum_kouho=maximum_kouho+1;
            }else{
              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
                maximum_kouho = 0;
            }
        } int i=1; int i=1; i 1 i<num i num i++ i++ i {
        	height[i] = sc.nextInt();
          	if(height[i]<=height[i-1]){ 
              maximum_kouho=maximum_kouho+1;
            }else{
              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
                maximum_kouho = 0;
            }
        } {
        	height[i] = sc.nextInt();
          	if(height[i]<=height[i-1]){ 
              maximum_kouho=maximum_kouho+1;
            }else{
              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
                maximum_kouho = 0;
            }
        } height[i] = sc.nextInt() height[i] height i sc.nextInt() sc.nextInt sc if(height[i]<=height[i-1]){ 
              maximum_kouho=maximum_kouho+1;
            }else{
              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
                maximum_kouho = 0;
            } height[i]<=height[i-1] height[i] height i height[i-1] height i-1 i 1 { 
              maximum_kouho=maximum_kouho+1;
            } maximum_kouho=maximum_kouho+1 maximum_kouho maximum_kouho+1 maximum_kouho 1 {
              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
                maximum_kouho = 0;
            } if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              } maximum_kouho>maximum maximum_kouho maximum {
              	maximum = maximum_kouho;
              } maximum = maximum_kouho maximum maximum_kouho maximum_kouho = 0 maximum_kouho 0 if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              } maximum_kouho>maximum maximum_kouho maximum {
              	maximum = maximum_kouho;
              } maximum = maximum_kouho maximum maximum_kouho System.out.println(maximum) System.out.println System.out System System.out maximum String[] args args public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
 		int num = sc.nextInt();
      	
      	int height[] = new int[num];
      	int kouho[] = new int[num];
      	int maximum = 0;
      	int maximum_kouho = 0;
      	height[0]=sc.nextInt();
      	for(int i=1;i<num;i++){
        	height[i] = sc.nextInt();
          	if(height[i]<=height[i-1]){ 
              maximum_kouho=maximum_kouho+1;
            }else{
              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
                maximum_kouho = 0;
            }
        }
      	              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
		
      	
		System.out.println(maximum);
	}
} public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
 		int num = sc.nextInt();
      	
      	int height[] = new int[num];
      	int kouho[] = new int[num];
      	int maximum = 0;
      	int maximum_kouho = 0;
      	height[0]=sc.nextInt();
      	for(int i=1;i<num;i++){
        	height[i] = sc.nextInt();
          	if(height[i]<=height[i-1]){ 
              maximum_kouho=maximum_kouho+1;
            }else{
              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
                maximum_kouho = 0;
            }
        }
      	              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
		
      	
		System.out.println(maximum);
	}
} Main
import java.util.*;
public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
 		int num = sc.nextInt();
      	
      	int height[] = new int[num];
      	int kouho[] = new int[num];
      	int maximum = 0;
      	int maximum_kouho = 0;
      	height[0]=sc.nextInt();
      	for(int i=1;i<num;i++){
        	height[i] = sc.nextInt();
          	if(height[i]<=height[i-1]){ 
              maximum_kouho=maximum_kouho+1;
            }else{
              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
                maximum_kouho = 0;
            }
        }
      	              if(maximum_kouho>maximum){
              	maximum = maximum_kouho;
              }
		
      	
		System.out.println(maximum);
	}
}