import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] h = new int[n];
		for (int i = 0; i < n; i++) {
			h[i] = sc.nextInt();
		}
		sc.close();

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

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

		int ans = 0;
		int cnt = 0;
		for (int i = 1; i < n; i++) {
			if (h[i - 1] >= h[i]) {
				cnt++;
				ans = Math.max(ans, cnt);
			} else {
				cnt = 0;
			}
		}
		System.out.println(ans);
	} main {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] h = new int[n];
		for (int i = 0; i < n; i++) {
			h[i] = sc.nextInt();
		}
		sc.close();

		int ans = 0;
		int cnt = 0;
		for (int i = 1; i < n; i++) {
			if (h[i - 1] >= h[i]) {
				cnt++;
				ans = Math.max(ans, cnt);
			} else {
				cnt = 0;
			}
		}
		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[] 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 sc.close() sc.close sc int ans = 0; ans 0 int cnt = 0; cnt 0 for (int i = 1; i < n; i++) {
			if (h[i - 1] >= h[i]) {
				cnt++;
				ans = Math.max(ans, cnt);
			} else {
				cnt = 0;
			}
		} int i = 1; int i = 1; i 1 i < n i n i++ i++ i {
			if (h[i - 1] >= h[i]) {
				cnt++;
				ans = Math.max(ans, cnt);
			} else {
				cnt = 0;
			}
		} {
			if (h[i - 1] >= h[i]) {
				cnt++;
				ans = Math.max(ans, cnt);
			} else {
				cnt = 0;
			}
		} if (h[i - 1] >= h[i]) {
				cnt++;
				ans = Math.max(ans, cnt);
			} else {
				cnt = 0;
			} h[i - 1] >= h[i] h[i - 1] h i - 1 i 1 h[i] h i {
				cnt++;
				ans = Math.max(ans, cnt);
			} cnt++ cnt ans = Math.max(ans, cnt) ans Math.max(ans, cnt) Math.max Math ans cnt {
				cnt = 0;
			} cnt = 0 cnt 0 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) throws Exception {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] h = new int[n];
		for (int i = 0; i < n; i++) {
			h[i] = sc.nextInt();
		}
		sc.close();

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

		int ans = 0;
		int cnt = 0;
		for (int i = 1; i < n; i++) {
			if (h[i - 1] >= h[i]) {
				cnt++;
				ans = Math.max(ans, cnt);
			} else {
				cnt = 0;
			}
		}
		System.out.println(ans);
	}
} Main
import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] h = new int[n];
		for (int i = 0; i < n; i++) {
			h[i] = sc.nextInt();
		}
		sc.close();

		int ans = 0;
		int cnt = 0;
		for (int i = 1; i < n; i++) {
			if (h[i - 1] >= h[i]) {
				cnt++;
				ans = Math.max(ans, cnt);
			} else {
				cnt = 0;
			}
		}
		System.out.println(ans);
	}
}
