import java.util.Scanner;

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 max = 0;
		int answer = 0;

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

		for (int i = 0; i < N - 1; i++) {
			answer = 0;
			for (int j = 0; j < N - i - 1; j++) {
				if (H[i + j] < H[i + j + 1]) {
					break;
				} else {
					answer++;
				}
			}
			if (max < answer) max = answer;
			if (N - i <= max) break;
		}

		System.out.println(max);
	}
}

/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