Kefa decided to make some money doing business on the Internet for exactly n days. He knows that on the i-th day (1 ≤ i ≤ n) he makes ai money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence ai. Let us remind you that the subsegment of the sequence is its continuous fragment. A subsegment of numbers is called non-decreasing if all numbers in it follow in the non-decreasing order.

Help Kefa cope with this task!

Input

The first line contains integer n (1 ≤ n ≤ 105).

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).

Output

Print a single integer — the length of the maximum non-decreasing subsegment of sequence a.

Examples

Input

6
2 2 1 3 4 1


Output

3

Input

3
2 2 9


Output

3

Note

In the first test the maximum non-decreasing subsegment is the numbers from the third to the fifth one.

In the second test the maximum non-decreasing subsegment is the numbers from the first to the third one.
import java.util.ArrayList;
import java.util.Scanner;

public class A580 {

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

        int n = scan.nextInt();
        int[] values = new int[n];
        for(int i = 0; i < n; i++) {
            values[i] = scan.nextInt();
        }

        // Brute force: Start at every number and loop until non decreasing O(n^2)
        /*
        int maxSeg = 0;
        for(int i = 0; i < n; i++) {
            int seg = 1;
            for(int k = i; k < n - 1; k++) {
                if(values[k] <= values[k + 1]) {
                    seg++;
                } else {
                    break;
                }
            }
            if(seg > maxSeg) {
                maxSeg = seg;
            }
        }

        System.out.println(maxSeg);
         */

        // Better solution: Find indices of decrease and find max length of segments O(n)

        ArrayList<Integer> decr = new ArrayList<Integer>();

        for(int i = 0; i < n - 1; i++) {
            if(values[i] > values[i + 1]) {
                decr.add(i);
            }
        }

        int maxSeg = -1;
        if(decr.size() == 0) {
            maxSeg = values.length;
        } else if (decr.size() == 1) {
            maxSeg = Math.max(decr.get(0) + 1, values.length - 1 - decr.get(0));
        } else {
            maxSeg = decr.get(0) + 1;
            for(int k = 0; k < decr.size(); k++) {
                int seg;
                if(k == decr.size() - 1) {
                    seg = values.length - 1 - decr.get(k);
                } else {
                    seg = decr.get(k + 1) - decr.get(k);
                }

                if(seg > maxSeg) {
                    maxSeg = seg;
                }
            }
        }

        System.out.println(maxSeg);

    }

}
