import java.lang.reflect.Array;
import 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();
        sc.close();

        int count = 0;
        int maxMv = 0;

        for (int i = 0; i < N - 1; i++) {
            if (H[i] >= H[i + 1]) {
                count++;
                if (i == N - 2) {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                }
            } else {
                if (maxMv < count) {
                    maxMv = count;
                }
                count = 0;
            }
        }

        System.out.println(maxMv);


    }
} import java.lang.reflect.Array; Array java.lang.reflect import java.util.*; util.* java 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();
        sc.close();

        int count = 0;
        int maxMv = 0;

        for (int i = 0; i < N - 1; i++) {
            if (H[i] >= H[i + 1]) {
                count++;
                if (i == N - 2) {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                }
            } else {
                if (maxMv < count) {
                    maxMv = count;
                }
                count = 0;
            }
        }

        System.out.println(maxMv);


    }
} 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();
        sc.close();

        int count = 0;
        int maxMv = 0;

        for (int i = 0; i < N - 1; i++) {
            if (H[i] >= H[i + 1]) {
                count++;
                if (i == N - 2) {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                }
            } else {
                if (maxMv < count) {
                    maxMv = count;
                }
                count = 0;
            }
        }

        System.out.println(maxMv);


    } 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();
        sc.close();

        int count = 0;
        int maxMv = 0;

        for (int i = 0; i < N - 1; i++) {
            if (H[i] >= H[i + 1]) {
                count++;
                if (i == N - 2) {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                }
            } else {
                if (maxMv < count) {
                    maxMv = count;
                }
                count = 0;
            }
        }

        System.out.println(maxMv);


    } 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 sc.close() sc.close sc int count = 0; count 0 int maxMv = 0; maxMv 0 for (int i = 0; i < N - 1; i++) {
            if (H[i] >= H[i + 1]) {
                count++;
                if (i == N - 2) {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                }
            } else {
                if (maxMv < count) {
                    maxMv = count;
                }
                count = 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]) {
                count++;
                if (i == N - 2) {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                }
            } else {
                if (maxMv < count) {
                    maxMv = count;
                }
                count = 0;
            }
        } {
            if (H[i] >= H[i + 1]) {
                count++;
                if (i == N - 2) {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                }
            } else {
                if (maxMv < count) {
                    maxMv = count;
                }
                count = 0;
            }
        } if (H[i] >= H[i + 1]) {
                count++;
                if (i == N - 2) {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                }
            } else {
                if (maxMv < count) {
                    maxMv = count;
                }
                count = 0;
            } H[i] >= H[i + 1] H[i] H i H[i + 1] H i + 1 i 1 {
                count++;
                if (i == N - 2) {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                }
            } count++ count if (i == N - 2) {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                } i == N - 2 i N - 2 N 2 {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                } if (maxMv < count) {
                        maxMv = count;
                    } maxMv < count maxMv count {
                        maxMv = count;
                    } maxMv = count maxMv count {
                if (maxMv < count) {
                    maxMv = count;
                }
                count = 0;
            } if (maxMv < count) {
                    maxMv = count;
                } maxMv < count maxMv count {
                    maxMv = count;
                } maxMv = count maxMv count count = 0 count 0 System.out.println(maxMv) System.out.println System.out System System.out maxMv 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();
        sc.close();

        int count = 0;
        int maxMv = 0;

        for (int i = 0; i < N - 1; i++) {
            if (H[i] >= H[i + 1]) {
                count++;
                if (i == N - 2) {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                }
            } else {
                if (maxMv < count) {
                    maxMv = count;
                }
                count = 0;
            }
        }

        System.out.println(maxMv);


    }
} 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();
        sc.close();

        int count = 0;
        int maxMv = 0;

        for (int i = 0; i < N - 1; i++) {
            if (H[i] >= H[i + 1]) {
                count++;
                if (i == N - 2) {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                }
            } else {
                if (maxMv < count) {
                    maxMv = count;
                }
                count = 0;
            }
        }

        System.out.println(maxMv);


    }
} Main
import java.lang.reflect.Array;
import 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();
        sc.close();

        int count = 0;
        int maxMv = 0;

        for (int i = 0; i < N - 1; i++) {
            if (H[i] >= H[i + 1]) {
                count++;
                if (i == N - 2) {
                    if (maxMv < count) {
                        maxMv = count;
                    }
                }
            } else {
                if (maxMv < count) {
                    maxMv = count;
                }
                count = 0;
            }
        }

        System.out.println(maxMv);


    }
}