import java.util.Scanner;

class Main {
    public static void main(final String[] args) {
        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();
        }
        int ans = 0;
        int len = 0;
        for (int i = 0; i< n-1; i++) {
            if (h[i] >= h[i+1]) {
                len++;
            } else {
                ans = Math.max(ans, len);
                len = 0;
            }
        }
        ans = Math.max(ans, len);

        System.out.println(ans);
    }

} import java.util.Scanner; Scanner java.util class Main {
    public static void main(final String[] args) {
        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();
        }
        int ans = 0;
        int len = 0;
        for (int i = 0; i< n-1; i++) {
            if (h[i] >= h[i+1]) {
                len++;
            } else {
                ans = Math.max(ans, len);
                len = 0;
            }
        }
        ans = Math.max(ans, len);

        System.out.println(ans);
    }

} Main public static void main(final String[] args) {
        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();
        }
        int ans = 0;
        int len = 0;
        for (int i = 0; i< n-1; i++) {
            if (h[i] >= h[i+1]) {
                len++;
            } else {
                ans = Math.max(ans, len);
                len = 0;
            }
        }
        ans = Math.max(ans, len);

        System.out.println(ans);
    } 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();
        }
        int ans = 0;
        int len = 0;
        for (int i = 0; i< n-1; i++) {
            if (h[i] >= h[i+1]) {
                len++;
            } else {
                ans = Math.max(ans, len);
                len = 0;
            }
        }
        ans = Math.max(ans, len);

        System.out.println(ans);
    } 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 ans = 0; ans 0 int len = 0; len 0 for (int i = 0; i< n-1; i++) {
            if (h[i] >= h[i+1]) {
                len++;
            } else {
                ans = Math.max(ans, len);
                len = 0;
            }
        } 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]) {
                len++;
            } else {
                ans = Math.max(ans, len);
                len = 0;
            }
        } {
            if (h[i] >= h[i+1]) {
                len++;
            } else {
                ans = Math.max(ans, len);
                len = 0;
            }
        } if (h[i] >= h[i+1]) {
                len++;
            } else {
                ans = Math.max(ans, len);
                len = 0;
            } h[i] >= h[i+1] h[i] h i h[i+1] h i+1 i 1 {
                len++;
            } len++ len {
                ans = Math.max(ans, len);
                len = 0;
            } ans = Math.max(ans, len) ans Math.max(ans, len) Math.max Math ans len len = 0 len 0 ans = Math.max(ans, len) ans Math.max(ans, len) Math.max Math ans len System.out.println(ans) System.out.println System.out System System.out ans final String[] args args
import java.util.Scanner;

class Main {
    public static void main(final String[] args) {
        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();
        }
        int ans = 0;
        int len = 0;
        for (int i = 0; i< n-1; i++) {
            if (h[i] >= h[i+1]) {
                len++;
            } else {
                ans = Math.max(ans, len);
                len = 0;
            }
        }
        ans = Math.max(ans, len);

        System.out.println(ans);
    }

}