import java.util.Scanner;

/**
 * Main
 */
public class Main {

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);

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

        int max = 0, count = 0;

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

        System.out.println(max);
        s.close();
    }
}
/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