import java.util.Scanner;

public class Main{

	static int max = 0;
	static int n;
	static int a[] = new int[100000];

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

		for (int i = 0; i < n;) {
			i += calc(i);
		}
		System.out.println(max);
	}

	public static int calc(int i) {
		int count = 0;
		while (i < n - 1 && a[i] >= a[i + 1]) {
			i++;
			count++;
		}
		if (count > max)
			max = count;
		if (count == 0)
			return 1;
		return count;
	}

}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz