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];
        int[] map = new int[n];
        int max = 0;
        int x;

        for(int i = 0; i < n; i++){
            h[i] = sc.nextInt();
        }

        map[n-1] = 0;
        for(int i = 2; i < n+1; i++){
            x = h[n-i+1];
            if(x <= h[n-i]){
                map[n-i] = map[n-i+1] + 1;
                max = Math.max(max, map[n-i]);
            }
            else map[n-i] = 0;
        }

        System.out.println(max);

    }

} 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];
        int[] map = new int[n];
        int max = 0;
        int x;

        for(int i = 0; i < n; i++){
            h[i] = sc.nextInt();
        }

        map[n-1] = 0;
        for(int i = 2; i < n+1; i++){
            x = h[n-i+1];
            if(x <= h[n-i]){
                map[n-i] = map[n-i+1] + 1;
                max = Math.max(max, map[n-i]);
            }
            else map[n-i] = 0;
        }

        System.out.println(max);

    }

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

        Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();

        int[] h = new int[n];
        int[] map = new int[n];
        int max = 0;
        int x;

        for(int i = 0; i < n; i++){
            h[i] = sc.nextInt();
        }

        map[n-1] = 0;
        for(int i = 2; i < n+1; i++){
            x = h[n-i+1];
            if(x <= h[n-i]){
                map[n-i] = map[n-i+1] + 1;
                max = Math.max(max, map[n-i]);
            }
            else map[n-i] = 0;
        }

        System.out.println(max);

    } main {

        Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();

        int[] h = new int[n];
        int[] map = new int[n];
        int max = 0;
        int x;

        for(int i = 0; i < n; i++){
            h[i] = sc.nextInt();
        }

        map[n-1] = 0;
        for(int i = 2; i < n+1; i++){
            x = h[n-i+1];
            if(x <= h[n-i]){
                map[n-i] = map[n-i+1] + 1;
                max = Math.max(max, map[n-i]);
            }
            else map[n-i] = 0;
        }

        System.out.println(max);

    } 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 int[] map = new int[n]; map new int[n] n int max = 0; max 0 int x; x 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] = sc.nextInt() h[i] h i sc.nextInt() sc.nextInt sc map[n-1] = 0 map[n-1] map n-1 n 1 0 for(int i = 2; i < n+1; i++){
            x = h[n-i+1];
            if(x <= h[n-i]){
                map[n-i] = map[n-i+1] + 1;
                max = Math.max(max, map[n-i]);
            }
            else map[n-i] = 0;
        } int i = 2; int i = 2; i 2 i < n+1 i n+1 n 1 i++ i++ i {
            x = h[n-i+1];
            if(x <= h[n-i]){
                map[n-i] = map[n-i+1] + 1;
                max = Math.max(max, map[n-i]);
            }
            else map[n-i] = 0;
        } {
            x = h[n-i+1];
            if(x <= h[n-i]){
                map[n-i] = map[n-i+1] + 1;
                max = Math.max(max, map[n-i]);
            }
            else map[n-i] = 0;
        } x = h[n-i+1] x h[n-i+1] h n-i+1 n-i n i 1 if(x <= h[n-i]){
                map[n-i] = map[n-i+1] + 1;
                max = Math.max(max, map[n-i]);
            }
            else map[n-i] = 0; x <= h[n-i] x h[n-i] h n-i n i {
                map[n-i] = map[n-i+1] + 1;
                max = Math.max(max, map[n-i]);
            } map[n-i] = map[n-i+1] + 1 map[n-i] map n-i n i map[n-i+1] + 1 map[n-i+1] map n-i+1 n-i n i 1 1 max = Math.max(max, map[n-i]) max Math.max(max, map[n-i]) Math.max Math max map[n-i] map n-i n i map[n-i] = 0 map[n-i] map n-i n i 0 System.out.println(max) System.out.println System.out System System.out max 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];
        int[] map = new int[n];
        int max = 0;
        int x;

        for(int i = 0; i < n; i++){
            h[i] = sc.nextInt();
        }

        map[n-1] = 0;
        for(int i = 2; i < n+1; i++){
            x = h[n-i+1];
            if(x <= h[n-i]){
                map[n-i] = map[n-i+1] + 1;
                max = Math.max(max, map[n-i]);
            }
            else map[n-i] = 0;
        }

        System.out.println(max);

    }

} public class Main{

    public static void main(String args[]){

        Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();

        int[] h = new int[n];
        int[] map = new int[n];
        int max = 0;
        int x;

        for(int i = 0; i < n; i++){
            h[i] = sc.nextInt();
        }

        map[n-1] = 0;
        for(int i = 2; i < n+1; i++){
            x = h[n-i+1];
            if(x <= h[n-i]){
                map[n-i] = map[n-i+1] + 1;
                max = Math.max(max, map[n-i]);
            }
            else map[n-i] = 0;
        }

        System.out.println(max);

    }

} Main
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];
        int[] map = new int[n];
        int max = 0;
        int x;

        for(int i = 0; i < n; i++){
            h[i] = sc.nextInt();
        }

        map[n-1] = 0;
        for(int i = 2; i < n+1; i++){
            x = h[n-i+1];
            if(x <= h[n-i]){
                map[n-i] = map[n-i+1] + 1;
                max = Math.max(max, map[n-i]);
            }
            else map[n-i] = 0;
        }

        System.out.println(max);

    }

}
