import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        int[] h = new int[n];
        for(int i=0;i<n;i++){
            h[i] = Integer.parseInt(sc.next());
        }
        sc.close();
        int count = 0;
        int maxCount = -1;
        for(int i=n-2;i>=0;i--){
            if(h[i] >= h[i+1]){
                count++;
            }else{
                if(count > maxCount){
                    maxCount = count;
                   
                }
               count = 0;
            }
        }
        maxCount = Math.max(maxCount,count);
        System.out.println(maxCount);
    }
} import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        int[] h = new int[n];
        for(int i=0;i<n;i++){
            h[i] = Integer.parseInt(sc.next());
        }
        sc.close();
        int count = 0;
        int maxCount = -1;
        for(int i=n-2;i>=0;i--){
            if(h[i] >= h[i+1]){
                count++;
            }else{
                if(count > maxCount){
                    maxCount = count;
                   
                }
               count = 0;
            }
        }
        maxCount = Math.max(maxCount,count);
        System.out.println(maxCount);
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        int[] h = new int[n];
        for(int i=0;i<n;i++){
            h[i] = Integer.parseInt(sc.next());
        }
        sc.close();
        int count = 0;
        int maxCount = -1;
        for(int i=n-2;i>=0;i--){
            if(h[i] >= h[i+1]){
                count++;
            }else{
                if(count > maxCount){
                    maxCount = count;
                   
                }
               count = 0;
            }
        }
        maxCount = Math.max(maxCount,count);
        System.out.println(maxCount);
    } main {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        int[] h = new int[n];
        for(int i=0;i<n;i++){
            h[i] = Integer.parseInt(sc.next());
        }
        sc.close();
        int count = 0;
        int maxCount = -1;
        for(int i=n-2;i>=0;i--){
            if(h[i] >= h[i+1]){
                count++;
            }else{
                if(count > maxCount){
                    maxCount = count;
                   
                }
               count = 0;
            }
        }
        maxCount = Math.max(maxCount,count);
        System.out.println(maxCount);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = Integer.parseInt(sc.next()); n Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc int[] h = new int[n]; h new int[n] n for(int i=0;i<n;i++){
            h[i] = Integer.parseInt(sc.next());
        } int i=0; int i=0; i 0 i<n i n i++ i++ i {
            h[i] = Integer.parseInt(sc.next());
        } {
            h[i] = Integer.parseInt(sc.next());
        } h[i] = Integer.parseInt(sc.next()) h[i] h i Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc sc.close() sc.close sc int count = 0; count 0 int maxCount = -1; maxCount -1 1 for(int i=n-2;i>=0;i--){
            if(h[i] >= h[i+1]){
                count++;
            }else{
                if(count > maxCount){
                    maxCount = count;
                   
                }
               count = 0;
            }
        } int i=n-2; int i=n-2; i n-2 n 2 i>=0 i 0 i-- i-- i {
            if(h[i] >= h[i+1]){
                count++;
            }else{
                if(count > maxCount){
                    maxCount = count;
                   
                }
               count = 0;
            }
        } {
            if(h[i] >= h[i+1]){
                count++;
            }else{
                if(count > maxCount){
                    maxCount = count;
                   
                }
               count = 0;
            }
        } if(h[i] >= h[i+1]){
                count++;
            }else{
                if(count > maxCount){
                    maxCount = count;
                   
                }
               count = 0;
            } h[i] >= h[i+1] h[i] h i h[i+1] h i+1 i 1 {
                count++;
            } count++ count {
                if(count > maxCount){
                    maxCount = count;
                   
                }
               count = 0;
            } if(count > maxCount){
                    maxCount = count;
                   
                } count > maxCount count maxCount {
                    maxCount = count;
                   
                } maxCount = count maxCount count count = 0 count 0 maxCount = Math.max(maxCount,count) maxCount Math.max(maxCount,count) Math.max Math maxCount count System.out.println(maxCount) System.out.println System.out System System.out maxCount String[] args args public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        int[] h = new int[n];
        for(int i=0;i<n;i++){
            h[i] = Integer.parseInt(sc.next());
        }
        sc.close();
        int count = 0;
        int maxCount = -1;
        for(int i=n-2;i>=0;i--){
            if(h[i] >= h[i+1]){
                count++;
            }else{
                if(count > maxCount){
                    maxCount = count;
                   
                }
               count = 0;
            }
        }
        maxCount = Math.max(maxCount,count);
        System.out.println(maxCount);
    }
} public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        int[] h = new int[n];
        for(int i=0;i<n;i++){
            h[i] = Integer.parseInt(sc.next());
        }
        sc.close();
        int count = 0;
        int maxCount = -1;
        for(int i=n-2;i>=0;i--){
            if(h[i] >= h[i+1]){
                count++;
            }else{
                if(count > maxCount){
                    maxCount = count;
                   
                }
               count = 0;
            }
        }
        maxCount = Math.max(maxCount,count);
        System.out.println(maxCount);
    }
} Main
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        int[] h = new int[n];
        for(int i=0;i<n;i++){
            h[i] = Integer.parseInt(sc.next());
        }
        sc.close();
        int count = 0;
        int maxCount = -1;
        for(int i=n-2;i>=0;i--){
            if(h[i] >= h[i+1]){
                count++;
            }else{
                if(count > maxCount){
                    maxCount = count;
                   
                }
               count = 0;
            }
        }
        maxCount = Math.max(maxCount,count);
        System.out.println(maxCount);
    }
}
