
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int N = scanner.nextInt();
        long[] H = new long[N];
        int[] count = new int[N];
        int maxCount = 0;

        for (int i = 0 ; i < N ; i++) {
            H[i] = scanner.nextLong();
        }

        for (int i = N - 2 ; i >= 0 ; i--) {
            if (H[i] >= H[i + 1]) {
                count[i] = count[i + 1] + 1;
            } else {
                count[i] = 0;
            }
            maxCount = Math.max(maxCount, count[i]);
        }

        System.out.println(maxCount);
    }
} import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int N = scanner.nextInt();
        long[] H = new long[N];
        int[] count = new int[N];
        int maxCount = 0;

        for (int i = 0 ; i < N ; i++) {
            H[i] = scanner.nextLong();
        }

        for (int i = N - 2 ; i >= 0 ; i--) {
            if (H[i] >= H[i + 1]) {
                count[i] = count[i + 1] + 1;
            } else {
                count[i] = 0;
            }
            maxCount = Math.max(maxCount, count[i]);
        }

        System.out.println(maxCount);
    }
} Main public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int N = scanner.nextInt();
        long[] H = new long[N];
        int[] count = new int[N];
        int maxCount = 0;

        for (int i = 0 ; i < N ; i++) {
            H[i] = scanner.nextLong();
        }

        for (int i = N - 2 ; i >= 0 ; i--) {
            if (H[i] >= H[i + 1]) {
                count[i] = count[i + 1] + 1;
            } else {
                count[i] = 0;
            }
            maxCount = Math.max(maxCount, count[i]);
        }

        System.out.println(maxCount);
    } main {
        Scanner scanner = new Scanner(System.in);

        int N = scanner.nextInt();
        long[] H = new long[N];
        int[] count = new int[N];
        int maxCount = 0;

        for (int i = 0 ; i < N ; i++) {
            H[i] = scanner.nextLong();
        }

        for (int i = N - 2 ; i >= 0 ; i--) {
            if (H[i] >= H[i + 1]) {
                count[i] = count[i + 1] + 1;
            } else {
                count[i] = 0;
            }
            maxCount = Math.max(maxCount, count[i]);
        }

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

        int N = scanner.nextInt();
        long[] H = new long[N];
        int[] count = new int[N];
        int maxCount = 0;

        for (int i = 0 ; i < N ; i++) {
            H[i] = scanner.nextLong();
        }

        for (int i = N - 2 ; i >= 0 ; i--) {
            if (H[i] >= H[i + 1]) {
                count[i] = count[i + 1] + 1;
            } else {
                count[i] = 0;
            }
            maxCount = Math.max(maxCount, count[i]);
        }

        System.out.println(maxCount);
    }
} public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int N = scanner.nextInt();
        long[] H = new long[N];
        int[] count = new int[N];
        int maxCount = 0;

        for (int i = 0 ; i < N ; i++) {
            H[i] = scanner.nextLong();
        }

        for (int i = N - 2 ; i >= 0 ; i--) {
            if (H[i] >= H[i + 1]) {
                count[i] = count[i + 1] + 1;
            } else {
                count[i] = 0;
            }
            maxCount = Math.max(maxCount, count[i]);
        }

        System.out.println(maxCount);
    }
} Main

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int N = scanner.nextInt();
        long[] H = new long[N];
        int[] count = new int[N];
        int maxCount = 0;

        for (int i = 0 ; i < N ; i++) {
            H[i] = scanner.nextLong();
        }

        for (int i = N - 2 ; i >= 0 ; i--) {
            if (H[i] >= H[i + 1]) {
                count[i] = count[i + 1] + 1;
            } else {
                count[i] = 0;
            }
            maxCount = Math.max(maxCount, count[i]);
        }

        System.out.println(maxCount);
    }
}
