import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		int[] h = new int[n];
		for(int i = 0; i < n; i++) {
			h[i] = sc.nextInt();
		}
		for(int i = 0; i < n-1; i++) {
		int count = 0;
		if(n-i<=ans) {
			break;
		}
			for(int j = i+1; j < n; j++) {
				if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				}
			}
			ans = Math.max(ans,count);
		}
		System.out.println(ans);
	}
} import java.util.Scanner; Scanner java.util public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		int[] h = new int[n];
		for(int i = 0; i < n; i++) {
			h[i] = sc.nextInt();
		}
		for(int i = 0; i < n-1; i++) {
		int count = 0;
		if(n-i<=ans) {
			break;
		}
			for(int j = i+1; j < n; j++) {
				if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				}
			}
			ans = Math.max(ans,count);
		}
		System.out.println(ans);
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		int[] h = new int[n];
		for(int i = 0; i < n; i++) {
			h[i] = sc.nextInt();
		}
		for(int i = 0; i < n-1; i++) {
		int count = 0;
		if(n-i<=ans) {
			break;
		}
			for(int j = i+1; j < n; j++) {
				if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				}
			}
			ans = Math.max(ans,count);
		}
		System.out.println(ans);
	} main {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		int[] h = new int[n];
		for(int i = 0; i < n; i++) {
			h[i] = sc.nextInt();
		}
		for(int i = 0; i < n-1; i++) {
		int count = 0;
		if(n-i<=ans) {
			break;
		}
			for(int j = i+1; j < n; j++) {
				if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				}
			}
			ans = Math.max(ans,count);
		}
		System.out.println(ans);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int ans = 0; ans 0 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] = sc.nextInt() h[i] h i sc.nextInt() sc.nextInt sc for(int i = 0; i < n-1; i++) {
		int count = 0;
		if(n-i<=ans) {
			break;
		}
			for(int j = i+1; j < n; j++) {
				if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				}
			}
			ans = Math.max(ans,count);
		} int i = 0; int i = 0; i 0 i < n-1 i n-1 n 1 i++ i++ i {
		int count = 0;
		if(n-i<=ans) {
			break;
		}
			for(int j = i+1; j < n; j++) {
				if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				}
			}
			ans = Math.max(ans,count);
		} {
		int count = 0;
		if(n-i<=ans) {
			break;
		}
			for(int j = i+1; j < n; j++) {
				if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				}
			}
			ans = Math.max(ans,count);
		} int count = 0; count 0 if(n-i<=ans) {
			break;
		} n-i<=ans n-i n i ans {
			break;
		} break; for(int j = i+1; j < n; j++) {
				if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				}
			} int j = i+1; int j = i+1; j i+1 i 1 j < n j n j++ j++ j {
				if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				}
			} {
				if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				}
			} if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				} h[i] >= h[j] h[i] h i h[j] h j {
					count++;
					h[i] = h[j];
				} count++ count h[i] = h[j] h[i] h i h[j] h j {
					break;
				} break; ans = Math.max(ans,count) ans Math.max(ans,count) Math.max Math ans count System.out.println(ans) System.out.println System.out System System.out ans String[] args args public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		int[] h = new int[n];
		for(int i = 0; i < n; i++) {
			h[i] = sc.nextInt();
		}
		for(int i = 0; i < n-1; i++) {
		int count = 0;
		if(n-i<=ans) {
			break;
		}
			for(int j = i+1; j < n; j++) {
				if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				}
			}
			ans = Math.max(ans,count);
		}
		System.out.println(ans);
	}
} public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		int[] h = new int[n];
		for(int i = 0; i < n; i++) {
			h[i] = sc.nextInt();
		}
		for(int i = 0; i < n-1; i++) {
		int count = 0;
		if(n-i<=ans) {
			break;
		}
			for(int j = i+1; j < n; j++) {
				if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				}
			}
			ans = Math.max(ans,count);
		}
		System.out.println(ans);
	}
} Main
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		int[] h = new int[n];
		for(int i = 0; i < n; i++) {
			h[i] = sc.nextInt();
		}
		for(int i = 0; i < n-1; i++) {
		int count = 0;
		if(n-i<=ans) {
			break;
		}
			for(int j = i+1; j < n; j++) {
				if(h[i] >= h[j]) {
					count++;
					h[i] = h[j];
				}
				else {
					break;
				}
			}
			ans = Math.max(ans,count);
		}
		System.out.println(ans);
	}
}
