import java.util.*;
import java.util.Arrays;

public class Main {
    public static void main(String[] args) throws Exception {

        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();  
        }
      	
     // Arrays.sort(H);
      
      int cnt = 0;
      List<Integer> cntList = new ArrayList<Integer>();
      for(int i = 0; i < N; i++){
      	for(int j = i+1; j < N; j++){
      	
          	if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            }
	      }	
     	cntList.add(cnt);
      }
      
     Collections.sort(cntList, Collections.reverseOrder());

      if(cntList.isEmpty()){
      	System.out.println(0);
        return;
        
      }
      System.out.println(cntList.get(0));
       	
    }
} import java.util.*; util.* java import java.util.Arrays; Arrays java.util public class Main {
    public static void main(String[] args) throws Exception {

        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();  
        }
      	
     // Arrays.sort(H);
      
      int cnt = 0;
      List<Integer> cntList = new ArrayList<Integer>();
      for(int i = 0; i < N; i++){
      	for(int j = i+1; j < N; j++){
      	
          	if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            }
	      }	
     	cntList.add(cnt);
      }
      
     Collections.sort(cntList, Collections.reverseOrder());

      if(cntList.isEmpty()){
      	System.out.println(0);
        return;
        
      }
      System.out.println(cntList.get(0));
       	
    }
} Main public static void main(String[] args) throws Exception {

        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();  
        }
      	
     // Arrays.sort(H);
      
      int cnt = 0;
      List<Integer> cntList = new ArrayList<Integer>();
      for(int i = 0; i < N; i++){
      	for(int j = i+1; j < N; j++){
      	
          	if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            }
	      }	
     	cntList.add(cnt);
      }
      
     Collections.sort(cntList, Collections.reverseOrder());

      if(cntList.isEmpty()){
      	System.out.println(0);
        return;
        
      }
      System.out.println(cntList.get(0));
       	
    } main {

        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();  
        }
      	
     // Arrays.sort(H);
      
      int cnt = 0;
      List<Integer> cntList = new ArrayList<Integer>();
      for(int i = 0; i < N; i++){
      	for(int j = i+1; j < N; j++){
      	
          	if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            }
	      }	
     	cntList.add(cnt);
      }
      
     Collections.sort(cntList, Collections.reverseOrder());

      if(cntList.isEmpty()){
      	System.out.println(0);
        return;
        
      }
      System.out.println(cntList.get(0));
       	
    } Scanner scan = new Scanner(System.in); scan new Scanner(System.in) int N = scan.nextInt(); N scan.nextInt() scan.nextInt scan int H[] = new int[N]; H new int[N] N for(int i = 0; i < N; i++){
        	H[i] = scan.nextInt();  
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
        	H[i] = scan.nextInt();  
        } {
        	H[i] = scan.nextInt();  
        } H[i] = scan.nextInt() H[i] H i scan.nextInt() scan.nextInt scan int cnt = 0; cnt 0 List<Integer> cntList = new ArrayList<Integer>(); cntList new ArrayList<Integer>() for(int i = 0; i < N; i++){
      	for(int j = i+1; j < N; j++){
      	
          	if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            }
	      }	
     	cntList.add(cnt);
      } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
      	for(int j = i+1; j < N; j++){
      	
          	if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            }
	      }	
     	cntList.add(cnt);
      } {
      	for(int j = i+1; j < N; j++){
      	
          	if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            }
	      }	
     	cntList.add(cnt);
      } for(int j = i+1; j < N; j++){
      	
          	if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            }
	      } int j = i+1; int j = i+1; j i+1 i 1 j < N j N j++ j++ j {
      	
          	if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            }
	      } {
      	
          	if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            }
	      } if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            } H[i] >= H[j] H[i] H i H[j] H j {
             	cnt++;
              	break;
            } cnt++ cnt break; {
              	cnt = 0;
             	break; 
            } cnt = 0 cnt 0 break; cntList.add(cnt) cntList.add cntList cnt Collections.sort(cntList, Collections.reverseOrder()) Collections.sort Collections cntList Collections.reverseOrder() Collections.reverseOrder Collections if(cntList.isEmpty()){
      	System.out.println(0);
        return;
        
      } cntList.isEmpty() cntList.isEmpty cntList {
      	System.out.println(0);
        return;
        
      } System.out.println(0) System.out.println System.out System System.out 0 return; System.out.println(cntList.get(0)) System.out.println System.out System System.out cntList.get(0) cntList.get cntList 0 String[] args args public class Main {
    public static void main(String[] args) throws Exception {

        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();  
        }
      	
     // Arrays.sort(H);
      
      int cnt = 0;
      List<Integer> cntList = new ArrayList<Integer>();
      for(int i = 0; i < N; i++){
      	for(int j = i+1; j < N; j++){
      	
          	if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            }
	      }	
     	cntList.add(cnt);
      }
      
     Collections.sort(cntList, Collections.reverseOrder());

      if(cntList.isEmpty()){
      	System.out.println(0);
        return;
        
      }
      System.out.println(cntList.get(0));
       	
    }
} public class Main {
    public static void main(String[] args) throws Exception {

        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();  
        }
      	
     // Arrays.sort(H);
      
      int cnt = 0;
      List<Integer> cntList = new ArrayList<Integer>();
      for(int i = 0; i < N; i++){
      	for(int j = i+1; j < N; j++){
      	
          	if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            }
	      }	
     	cntList.add(cnt);
      }
      
     Collections.sort(cntList, Collections.reverseOrder());

      if(cntList.isEmpty()){
      	System.out.println(0);
        return;
        
      }
      System.out.println(cntList.get(0));
       	
    }
} Main
import java.util.*;
import java.util.Arrays;

public class Main {
    public static void main(String[] args) throws Exception {

        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();  
        }
      	
     // Arrays.sort(H);
      
      int cnt = 0;
      List<Integer> cntList = new ArrayList<Integer>();
      for(int i = 0; i < N; i++){
      	for(int j = i+1; j < N; j++){
      	
          	if(H[i] >= H[j]){
             	cnt++;
              	break;
            } else {
              	cnt = 0;
             	break; 
            }
	      }	
     	cntList.add(cnt);
      }
      
     Collections.sort(cntList, Collections.reverseOrder());

      if(cntList.isEmpty()){
      	System.out.println(0);
        return;
        
      }
      System.out.println(cntList.get(0));
       	
    }
}
