import java.util.*;
public class Main{

	public static void main(String[] args){

		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		long A[]=new long[n];
		for(int i=0;i<n;i++) {
			A[i]=sc.nextLong();
		}
		
		long dp[]=new long[n];
		for(int i=n-2;i>=0;i--){
			if(A[i]>=A[i+1]){
				dp[i]=dp[i+1]+1;
			}
			else dp[i]=0;
		}
//		for(int i=0;i<n;i++) {
//			System.out.println(dp[i]+" ");
//		}
		long max=0;
		for(int i=0;i<n;i++){
			if(max<dp[i]){
				max=dp[i];
			}
		}

		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();
		long A[]=new long[n];
		for(int i=0;i<n;i++) {
			A[i]=sc.nextLong();
		}
		
		long dp[]=new long[n];
		for(int i=n-2;i>=0;i--){
			if(A[i]>=A[i+1]){
				dp[i]=dp[i+1]+1;
			}
			else dp[i]=0;
		}
//		for(int i=0;i<n;i++) {
//			System.out.println(dp[i]+" ");
//		}
		long max=0;
		for(int i=0;i<n;i++){
			if(max<dp[i]){
				max=dp[i];
			}
		}

		System.out.println(max);
	}


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

		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		long A[]=new long[n];
		for(int i=0;i<n;i++) {
			A[i]=sc.nextLong();
		}
		
		long dp[]=new long[n];
		for(int i=n-2;i>=0;i--){
			if(A[i]>=A[i+1]){
				dp[i]=dp[i+1]+1;
			}
			else dp[i]=0;
		}
//		for(int i=0;i<n;i++) {
//			System.out.println(dp[i]+" ");
//		}
		long max=0;
		for(int i=0;i<n;i++){
			if(max<dp[i]){
				max=dp[i];
			}
		}

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

		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		long A[]=new long[n];
		for(int i=0;i<n;i++) {
			A[i]=sc.nextLong();
		}
		
		long dp[]=new long[n];
		for(int i=n-2;i>=0;i--){
			if(A[i]>=A[i+1]){
				dp[i]=dp[i+1]+1;
			}
			else dp[i]=0;
		}
//		for(int i=0;i<n;i++) {
//			System.out.println(dp[i]+" ");
//		}
		long max=0;
		for(int i=0;i<n;i++){
			if(max<dp[i]){
				max=dp[i];
			}
		}

		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 long A[]=new long[n]; A new long[n] n for(int i=0;i<n;i++) {
			A[i]=sc.nextLong();
		} int i=0; int i=0; i 0 i<n i n i++ i++ i {
			A[i]=sc.nextLong();
		} {
			A[i]=sc.nextLong();
		} A[i]=sc.nextLong() A[i] A i sc.nextLong() sc.nextLong sc long dp[]=new long[n]; dp new long[n] n for(int i=n-2;i>=0;i--){
			if(A[i]>=A[i+1]){
				dp[i]=dp[i+1]+1;
			}
			else dp[i]=0;
		} int i=n-2; int i=n-2; i n-2 n 2 i>=0 i 0 i-- i-- i {
			if(A[i]>=A[i+1]){
				dp[i]=dp[i+1]+1;
			}
			else dp[i]=0;
		} {
			if(A[i]>=A[i+1]){
				dp[i]=dp[i+1]+1;
			}
			else dp[i]=0;
		} if(A[i]>=A[i+1]){
				dp[i]=dp[i+1]+1;
			}
			else dp[i]=0; A[i]>=A[i+1] A[i] A i A[i+1] A i+1 i 1 {
				dp[i]=dp[i+1]+1;
			} dp[i]=dp[i+1]+1 dp[i] dp i dp[i+1]+1 dp[i+1] dp i+1 i 1 1 dp[i]=0 dp[i] dp i 0 long max=0; max 0 for(int i=0;i<n;i++){
			if(max<dp[i]){
				max=dp[i];
			}
		} int i=0; int i=0; i 0 i<n i n i++ i++ i {
			if(max<dp[i]){
				max=dp[i];
			}
		} {
			if(max<dp[i]){
				max=dp[i];
			}
		} if(max<dp[i]){
				max=dp[i];
			} max<dp[i] max dp[i] dp i {
				max=dp[i];
			} max=dp[i] max dp[i] dp i 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();
		long A[]=new long[n];
		for(int i=0;i<n;i++) {
			A[i]=sc.nextLong();
		}
		
		long dp[]=new long[n];
		for(int i=n-2;i>=0;i--){
			if(A[i]>=A[i+1]){
				dp[i]=dp[i+1]+1;
			}
			else dp[i]=0;
		}
//		for(int i=0;i<n;i++) {
//			System.out.println(dp[i]+" ");
//		}
		long max=0;
		for(int i=0;i<n;i++){
			if(max<dp[i]){
				max=dp[i];
			}
		}

		System.out.println(max);
	}


} public class Main{

	public static void main(String[] args){

		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		long A[]=new long[n];
		for(int i=0;i<n;i++) {
			A[i]=sc.nextLong();
		}
		
		long dp[]=new long[n];
		for(int i=n-2;i>=0;i--){
			if(A[i]>=A[i+1]){
				dp[i]=dp[i+1]+1;
			}
			else dp[i]=0;
		}
//		for(int i=0;i<n;i++) {
//			System.out.println(dp[i]+" ");
//		}
		long max=0;
		for(int i=0;i<n;i++){
			if(max<dp[i]){
				max=dp[i];
			}
		}

		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();
		long A[]=new long[n];
		for(int i=0;i<n;i++) {
			A[i]=sc.nextLong();
		}
		
		long dp[]=new long[n];
		for(int i=n-2;i>=0;i--){
			if(A[i]>=A[i+1]){
				dp[i]=dp[i+1]+1;
			}
			else dp[i]=0;
		}
//		for(int i=0;i<n;i++) {
//			System.out.println(dp[i]+" ");
//		}
		long max=0;
		for(int i=0;i<n;i++){
			if(max<dp[i]){
				max=dp[i];
			}
		}

		System.out.println(max);
	}


}