import java.util.*;
import java.math.BigInteger;

public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        //String str = sc.next();
        int N = sc.nextInt();
        int[] h = new int[N];
        int count = 0;
        int max = 0;
        
        for(int i=0; i<N; i++){
            h[i] = sc.nextInt();
            if(i>0){
                if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                }
            }
        }
        
        System.out.println(max);
        
    }
} import java.util.*; util.* java import java.math.BigInteger; BigInteger java.math public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        //String str = sc.next();
        int N = sc.nextInt();
        int[] h = new int[N];
        int count = 0;
        int max = 0;
        
        for(int i=0; i<N; i++){
            h[i] = sc.nextInt();
            if(i>0){
                if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                }
            }
        }
        
        System.out.println(max);
        
    }
} Main public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        //String str = sc.next();
        int N = sc.nextInt();
        int[] h = new int[N];
        int count = 0;
        int max = 0;
        
        for(int i=0; i<N; i++){
            h[i] = sc.nextInt();
            if(i>0){
                if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                }
            }
        }
        
        System.out.println(max);
        
    } main {
        Scanner sc = new Scanner(System.in);
        //String str = sc.next();
        int N = sc.nextInt();
        int[] h = new int[N];
        int count = 0;
        int max = 0;
        
        for(int i=0; i<N; i++){
            h[i] = sc.nextInt();
            if(i>0){
                if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                }
            }
        }
        
        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 int[] h = new int[N]; h new int[N] N int count = 0; count 0 int max = 0; max 0 for(int i=0; i<N; i++){
            h[i] = sc.nextInt();
            if(i>0){
                if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                }
            }
        } int i=0; int i=0; i 0 i<N i N i++ i++ i {
            h[i] = sc.nextInt();
            if(i>0){
                if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                }
            }
        } {
            h[i] = sc.nextInt();
            if(i>0){
                if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                }
            }
        } h[i] = sc.nextInt() h[i] h i sc.nextInt() sc.nextInt sc if(i>0){
                if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                }
            } i>0 i 0 {
                if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                }
            } if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                } h[i-1] >= h[i] h[i-1] h i-1 i 1 h[i] h i {
                    count++;
                    if(max < count){
                        max = count;
                    }
                } count++ count if(max < count){
                        max = count;
                    } max < count max count {
                        max = count;
                    } max = count max count {
                    count = 0;
                } count = 0 count 0 System.out.println(max) System.out.println System.out System System.out max String[] args args public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        //String str = sc.next();
        int N = sc.nextInt();
        int[] h = new int[N];
        int count = 0;
        int max = 0;
        
        for(int i=0; i<N; i++){
            h[i] = sc.nextInt();
            if(i>0){
                if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                }
            }
        }
        
        System.out.println(max);
        
    }
} public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        //String str = sc.next();
        int N = sc.nextInt();
        int[] h = new int[N];
        int count = 0;
        int max = 0;
        
        for(int i=0; i<N; i++){
            h[i] = sc.nextInt();
            if(i>0){
                if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                }
            }
        }
        
        System.out.println(max);
        
    }
} Main
import java.util.*;
import java.math.BigInteger;

public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        //String str = sc.next();
        int N = sc.nextInt();
        int[] h = new int[N];
        int count = 0;
        int max = 0;
        
        for(int i=0; i<N; i++){
            h[i] = sc.nextInt();
            if(i>0){
                if(h[i-1] >= h[i]){
                    count++;
                    if(max < count){
                        max = count;
                    }
                }else{
                    count = 0;
                }
            }
        }
        
        System.out.println(max);
        
    }
}
