import java.util.Scanner;

public class Main {
    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        long[] harr = new long[N];

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

        int result = 0;
        for (int i=0; i< N-1; i++) {
            if (result >= (N-1 - i)) break;
            int tmp = 0;
            for (int k=i; k< N-1; k++) {
                if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                }
            }
            if (tmp > result) {
                result = tmp;
            }
        }

        System.out.println(result);
    }
} 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[] harr = new long[N];

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

        int result = 0;
        for (int i=0; i< N-1; i++) {
            if (result >= (N-1 - i)) break;
            int tmp = 0;
            for (int k=i; k< N-1; k++) {
                if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                }
            }
            if (tmp > result) {
                result = tmp;
            }
        }

        System.out.println(result);
    }
} Main public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        long[] harr = new long[N];

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

        int result = 0;
        for (int i=0; i< N-1; i++) {
            if (result >= (N-1 - i)) break;
            int tmp = 0;
            for (int k=i; k< N-1; k++) {
                if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                }
            }
            if (tmp > result) {
                result = tmp;
            }
        }

        System.out.println(result);
    } main {

        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        long[] harr = new long[N];

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

        int result = 0;
        for (int i=0; i< N-1; i++) {
            if (result >= (N-1 - i)) break;
            int tmp = 0;
            for (int k=i; k< N-1; k++) {
                if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                }
            }
            if (tmp > result) {
                result = tmp;
            }
        }

        System.out.println(result);
    } Scanner scanner = new Scanner(System.in); scanner new Scanner(System.in) int N = scanner.nextInt(); N scanner.nextInt() scanner.nextInt scanner long[] harr = new long[N]; harr new long[N] N for (int i=0; i<N; i++) {
            harr[i] = scanner.nextLong();
        } int i=0; int i=0; i 0 i<N i N i++ i++ i {
            harr[i] = scanner.nextLong();
        } {
            harr[i] = scanner.nextLong();
        } harr[i] = scanner.nextLong() harr[i] harr i scanner.nextLong() scanner.nextLong scanner int result = 0; result 0 for (int i=0; i< N-1; i++) {
            if (result >= (N-1 - i)) break;
            int tmp = 0;
            for (int k=i; k< N-1; k++) {
                if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                }
            }
            if (tmp > result) {
                result = tmp;
            }
        } int i=0; int i=0; i 0 i< N-1 i N-1 N 1 i++ i++ i {
            if (result >= (N-1 - i)) break;
            int tmp = 0;
            for (int k=i; k< N-1; k++) {
                if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                }
            }
            if (tmp > result) {
                result = tmp;
            }
        } {
            if (result >= (N-1 - i)) break;
            int tmp = 0;
            for (int k=i; k< N-1; k++) {
                if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                }
            }
            if (tmp > result) {
                result = tmp;
            }
        } if (result >= (N-1 - i)) break; result >= (N-1 - i) result (N-1 - i) N-1 - i N 1 i break; int tmp = 0; tmp 0 for (int k=i; k< N-1; k++) {
                if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                }
            } int k=i; int k=i; k i k< N-1 k N-1 N 1 k++ k++ k {
                if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                }
            } {
                if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                }
            } if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                } harr[k] >= harr[k+1] harr[k] harr k harr[k+1] harr k+1 k 1 {
                    tmp++;
                } tmp++ tmp {
                    break;
                } break; if (tmp > result) {
                result = tmp;
            } tmp > result tmp result {
                result = tmp;
            } result = tmp result tmp System.out.println(result) System.out.println System.out System System.out result String[] args args public class Main {
    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        long[] harr = new long[N];

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

        int result = 0;
        for (int i=0; i< N-1; i++) {
            if (result >= (N-1 - i)) break;
            int tmp = 0;
            for (int k=i; k< N-1; k++) {
                if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                }
            }
            if (tmp > result) {
                result = tmp;
            }
        }

        System.out.println(result);
    }
} public class Main {
    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        long[] harr = new long[N];

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

        int result = 0;
        for (int i=0; i< N-1; i++) {
            if (result >= (N-1 - i)) break;
            int tmp = 0;
            for (int k=i; k< N-1; k++) {
                if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                }
            }
            if (tmp > result) {
                result = tmp;
            }
        }

        System.out.println(result);
    }
} 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[] harr = new long[N];

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

        int result = 0;
        for (int i=0; i< N-1; i++) {
            if (result >= (N-1 - i)) break;
            int tmp = 0;
            for (int k=i; k< N-1; k++) {
                if (harr[k] >= harr[k+1]) {
                    tmp++;
                } else {
                    break;
                }
            }
            if (tmp > result) {
                result = tmp;
            }
        }

        System.out.println(result);
    }
}