
import java.util.*;
import java.lang.*;

class Main {
	public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        int H[] = new int[N];
        for(int i = 0; i < N; i++){
            H[i] = Integer.parseInt(sc.next());
        }

        int i = 0;
        int j = 0;
        int count = 0;
        int maxCount = 0;

        while(i < N){
            j = i;
            count = 0;
            while(j < N-1){
                if(H[j] >= H[j+1]){
                    count ++;
                    j ++;
                } else {
                    break;
                }
            }
            maxCount = Math.max(maxCount, count);
            i += count + 1;
        }


        System.out.println(maxCount);

    }
}


 import java.util.*; util.* java import java.lang.*; lang.* java class Main {
	public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        int H[] = new int[N];
        for(int i = 0; i < N; i++){
            H[i] = Integer.parseInt(sc.next());
        }

        int i = 0;
        int j = 0;
        int count = 0;
        int maxCount = 0;

        while(i < N){
            j = i;
            count = 0;
            while(j < N-1){
                if(H[j] >= H[j+1]){
                    count ++;
                    j ++;
                } else {
                    break;
                }
            }
            maxCount = Math.max(maxCount, count);
            i += count + 1;
        }


        System.out.println(maxCount);

    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        int H[] = new int[N];
        for(int i = 0; i < N; i++){
            H[i] = Integer.parseInt(sc.next());
        }

        int i = 0;
        int j = 0;
        int count = 0;
        int maxCount = 0;

        while(i < N){
            j = i;
            count = 0;
            while(j < N-1){
                if(H[j] >= H[j+1]){
                    count ++;
                    j ++;
                } else {
                    break;
                }
            }
            maxCount = Math.max(maxCount, count);
            i += count + 1;
        }


        System.out.println(maxCount);

    } main {
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        int H[] = new int[N];
        for(int i = 0; i < N; i++){
            H[i] = Integer.parseInt(sc.next());
        }

        int i = 0;
        int j = 0;
        int count = 0;
        int maxCount = 0;

        while(i < N){
            j = i;
            count = 0;
            while(j < N-1){
                if(H[j] >= H[j+1]){
                    count ++;
                    j ++;
                } else {
                    break;
                }
            }
            maxCount = Math.max(maxCount, count);
            i += count + 1;
        }


        System.out.println(maxCount);

    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = Integer.parseInt(sc.next()); N Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc int H[] = new int[N]; H new int[N] N for(int i = 0; i < N; i++){
            H[i] = Integer.parseInt(sc.next());
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            H[i] = Integer.parseInt(sc.next());
        } {
            H[i] = Integer.parseInt(sc.next());
        } H[i] = Integer.parseInt(sc.next()) H[i] H i Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc int i = 0; i 0 int j = 0; j 0 int count = 0; count 0 int maxCount = 0; maxCount 0 while(i < N){
            j = i;
            count = 0;
            while(j < N-1){
                if(H[j] >= H[j+1]){
                    count ++;
                    j ++;
                } else {
                    break;
                }
            }
            maxCount = Math.max(maxCount, count);
            i += count + 1;
        } i < N i N {
            j = i;
            count = 0;
            while(j < N-1){
                if(H[j] >= H[j+1]){
                    count ++;
                    j ++;
                } else {
                    break;
                }
            }
            maxCount = Math.max(maxCount, count);
            i += count + 1;
        } j = i j i count = 0 count 0 while(j < N-1){
                if(H[j] >= H[j+1]){
                    count ++;
                    j ++;
                } else {
                    break;
                }
            } j < N-1 j N-1 N 1 {
                if(H[j] >= H[j+1]){
                    count ++;
                    j ++;
                } else {
                    break;
                }
            } if(H[j] >= H[j+1]){
                    count ++;
                    j ++;
                } else {
                    break;
                } H[j] >= H[j+1] H[j] H j H[j+1] H j+1 j 1 {
                    count ++;
                    j ++;
                } count ++ count j ++ j {
                    break;
                } break; maxCount = Math.max(maxCount, count) maxCount Math.max(maxCount, count) Math.max Math maxCount count i += count + 1 i count + 1 count 1 System.out.println(maxCount) System.out.println System.out System System.out maxCount String[] args args

import java.util.*;
import java.lang.*;

class Main {
	public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        int H[] = new int[N];
        for(int i = 0; i < N; i++){
            H[i] = Integer.parseInt(sc.next());
        }

        int i = 0;
        int j = 0;
        int count = 0;
        int maxCount = 0;

        while(i < N){
            j = i;
            count = 0;
            while(j < N-1){
                if(H[j] >= H[j+1]){
                    count ++;
                    j ++;
                } else {
                    break;
                }
            }
            maxCount = Math.max(maxCount, count);
            i += count + 1;
        }


        System.out.println(maxCount);

    }
}



