import java.util.*;

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

        int[] daySpan = new int[n];
        daySpan[0] = 0;
        int min = Integer.MAX_VALUE;
        int maxDaySpan = 1;
        for (int i = 1; i < n; i++) {
            daySpan[i] = 0;
            if(plants[i]<min){
                min = plants[i];
                daySpan[i] =0;
                continue;
            }
            if(plants[i]>plants[i-1]){
                daySpan[i] = 1;
            }else{
                int j = i - 1;
                daySpan[i]++;
                for(;plants[i]<=plants[j]&&maxDaySpan>=daySpan[j];j--){
                    if(j!=-1) {
                        daySpan[i]++;
                    }
                }
                if(daySpan[i]>maxDaySpan){
                    daySpan[i] = maxDaySpan + 1;
                    maxDaySpan = daySpan[i];
                }
            }

        }
        Arrays.sort(daySpan);
        System.out.println(daySpan[daySpan.length - 1]);
    }
}