import java.util.Scanner;

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

        int N = sc.nextInt();
        int[] H = new int[N];

        for (int i = 0; i < N; i++) H[i] = sc.nextInt();

        int longest = 0;
        int current = 0;

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

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

        int N = sc.nextInt();
        int[] H = new int[N];

        for (int i = 0; i < N; i++) H[i] = sc.nextInt();

        int longest = 0;
        int current = 0;

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

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

        int N = sc.nextInt();
        int[] H = new int[N];

        for (int i = 0; i < N; i++) H[i] = sc.nextInt();

        int longest = 0;
        int current = 0;

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

        System.out.println(longest);
    } main {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int[] H = new int[N];

        for (int i = 0; i < N; i++) H[i] = sc.nextInt();

        int longest = 0;
        int current = 0;

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

        System.out.println(longest);
    } 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 for (int i = 0; i < N; i++) H[i] = sc.nextInt(); int i = 0; int i = 0; i 0 i < N i N i++ i++ i H[i] = sc.nextInt(); H[i] = sc.nextInt() H[i] H i sc.nextInt() sc.nextInt sc int longest = 0; longest 0 int current = 0; current 0 for (int i = 1; i < N; i++) {
            if (H[i] > H[i - 1]) {
                current = 0;
            } else {
                current++;
            }
            longest = Math.max(current, longest);
        } int i = 1; int i = 1; i 1 i < N i N i++ i++ i {
            if (H[i] > H[i - 1]) {
                current = 0;
            } else {
                current++;
            }
            longest = Math.max(current, longest);
        } {
            if (H[i] > H[i - 1]) {
                current = 0;
            } else {
                current++;
            }
            longest = Math.max(current, longest);
        } if (H[i] > H[i - 1]) {
                current = 0;
            } else {
                current++;
            } H[i] > H[i - 1] H[i] H i H[i - 1] H i - 1 i 1 {
                current = 0;
            } current = 0 current 0 {
                current++;
            } current++ current longest = Math.max(current, longest) longest Math.max(current, longest) Math.max Math current longest System.out.println(longest) System.out.println System.out System System.out longest String[] args args public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int[] H = new int[N];

        for (int i = 0; i < N; i++) H[i] = sc.nextInt();

        int longest = 0;
        int current = 0;

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

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

        int N = sc.nextInt();
        int[] H = new int[N];

        for (int i = 0; i < N; i++) H[i] = sc.nextInt();

        int longest = 0;
        int current = 0;

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

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

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

        int N = sc.nextInt();
        int[] H = new int[N];

        for (int i = 0; i < N; i++) H[i] = sc.nextInt();

        int longest = 0;
        int current = 0;

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

        System.out.println(longest);
    }
}