import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int[] cumsum = new int[N];
            for (int j = N - 1 - 1; j >= 0; j--) {
                if (H[j] >= H[j + 1]) {
                    cumsum[j] = 1 + cumsum[j + 1];
                } else {
                    cumsum[j] = 0;
                }
            }

            int max = 0;
            for (int j = 0; j < N; j++) {
                max = Math.max(max, cumsum[j]);
            }

            System.out.println(max);
        }
    }
} import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int[] cumsum = new int[N];
            for (int j = N - 1 - 1; j >= 0; j--) {
                if (H[j] >= H[j + 1]) {
                    cumsum[j] = 1 + cumsum[j + 1];
                } else {
                    cumsum[j] = 0;
                }
            }

            int max = 0;
            for (int j = 0; j < N; j++) {
                max = Math.max(max, cumsum[j]);
            }

            System.out.println(max);
        }
    }
} Main public static void main(String[] args) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int[] cumsum = new int[N];
            for (int j = N - 1 - 1; j >= 0; j--) {
                if (H[j] >= H[j + 1]) {
                    cumsum[j] = 1 + cumsum[j + 1];
                } else {
                    cumsum[j] = 0;
                }
            }

            int max = 0;
            for (int j = 0; j < N; j++) {
                max = Math.max(max, cumsum[j]);
            }

            System.out.println(max);
        }
    } main {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int[] cumsum = new int[N];
            for (int j = N - 1 - 1; j >= 0; j--) {
                if (H[j] >= H[j + 1]) {
                    cumsum[j] = 1 + cumsum[j + 1];
                } else {
                    cumsum[j] = 0;
                }
            }

            int max = 0;
            for (int j = 0; j < N; j++) {
                max = Math.max(max, cumsum[j]);
            }

            System.out.println(max);
        }
    } try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int[] cumsum = new int[N];
            for (int j = N - 1 - 1; j >= 0; j--) {
                if (H[j] >= H[j + 1]) {
                    cumsum[j] = 1 + cumsum[j + 1];
                } else {
                    cumsum[j] = 0;
                }
            }

            int max = 0;
            for (int j = 0; j < N; j++) {
                max = Math.max(max, cumsum[j]);
            }

            System.out.println(max);
        } {
            int N = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int[] cumsum = new int[N];
            for (int j = N - 1 - 1; j >= 0; j--) {
                if (H[j] >= H[j + 1]) {
                    cumsum[j] = 1 + cumsum[j + 1];
                } else {
                    cumsum[j] = 0;
                }
            }

            int max = 0;
            for (int j = 0; j < N; j++) {
                max = Math.max(max, cumsum[j]);
            }

            System.out.println(max);
        } Scanner in = new Scanner(System.in) Scanner in = new Scanner(System.in) new Scanner(System.in) int N = in.nextInt(); N in.nextInt() in.nextInt in int[] H = new int[N]; H new int[N] N for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
                H[i] = in.nextInt();
            } {
                H[i] = in.nextInt();
            } H[i] = in.nextInt() H[i] H i in.nextInt() in.nextInt in int[] cumsum = new int[N]; cumsum new int[N] N for (int j = N - 1 - 1; j >= 0; j--) {
                if (H[j] >= H[j + 1]) {
                    cumsum[j] = 1 + cumsum[j + 1];
                } else {
                    cumsum[j] = 0;
                }
            } int j = N - 1 - 1; int j = N - 1 - 1; j N - 1 - 1 N - 1 - 1 N 1 1 j >= 0 j 0 j-- j-- j {
                if (H[j] >= H[j + 1]) {
                    cumsum[j] = 1 + cumsum[j + 1];
                } else {
                    cumsum[j] = 0;
                }
            } {
                if (H[j] >= H[j + 1]) {
                    cumsum[j] = 1 + cumsum[j + 1];
                } else {
                    cumsum[j] = 0;
                }
            } if (H[j] >= H[j + 1]) {
                    cumsum[j] = 1 + cumsum[j + 1];
                } else {
                    cumsum[j] = 0;
                } H[j] >= H[j + 1] H[j] H j H[j + 1] H j + 1 j 1 {
                    cumsum[j] = 1 + cumsum[j + 1];
                } cumsum[j] = 1 + cumsum[j + 1] cumsum[j] cumsum j 1 + cumsum[j + 1] 1 cumsum[j + 1] cumsum j + 1 j 1 {
                    cumsum[j] = 0;
                } cumsum[j] = 0 cumsum[j] cumsum j 0 int max = 0; max 0 for (int j = 0; j < N; j++) {
                max = Math.max(max, cumsum[j]);
            } int j = 0; int j = 0; j 0 j < N j N j++ j++ j {
                max = Math.max(max, cumsum[j]);
            } {
                max = Math.max(max, cumsum[j]);
            } max = Math.max(max, cumsum[j]) max Math.max(max, cumsum[j]) Math.max Math max cumsum[j] cumsum j 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) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int[] cumsum = new int[N];
            for (int j = N - 1 - 1; j >= 0; j--) {
                if (H[j] >= H[j + 1]) {
                    cumsum[j] = 1 + cumsum[j + 1];
                } else {
                    cumsum[j] = 0;
                }
            }

            int max = 0;
            for (int j = 0; j < N; j++) {
                max = Math.max(max, cumsum[j]);
            }

            System.out.println(max);
        }
    }
} public class Main {
    public static void main(String[] args) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int[] cumsum = new int[N];
            for (int j = N - 1 - 1; j >= 0; j--) {
                if (H[j] >= H[j + 1]) {
                    cumsum[j] = 1 + cumsum[j + 1];
                } else {
                    cumsum[j] = 0;
                }
            }

            int max = 0;
            for (int j = 0; j < N; j++) {
                max = Math.max(max, cumsum[j]);
            }

            System.out.println(max);
        }
    }
} Main
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int[] cumsum = new int[N];
            for (int j = N - 1 - 1; j >= 0; j--) {
                if (H[j] >= H[j + 1]) {
                    cumsum[j] = 1 + cumsum[j + 1];
                } else {
                    cumsum[j] = 0;
                }
            }

            int max = 0;
            for (int j = 0; j < N; j++) {
                max = Math.max(max, cumsum[j]);
            }

            System.out.println(max);
        }
    }
}
