import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int N = in.nextInt();

        int[] squares = new int[N];

        for (int i = 0; i < squares.length; i++) {
            squares[i] = in.nextInt();
        }

        int min = 0, count = 0;
        boolean flag = false;
        for (int i = squares.length-1; i > 0; i--) {
            if (squares[i] <= squares[i-1]) {
                count++;
            }
            else {
                flag = true;
                min = Math.max(count, min);
                count = 0;
            }
        }

        if (flag) System.out.println(min);
        else System.out.println(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