import java.util.Scanner;

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

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