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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;

import java.util.Collections;
import java.util.List;

public class KefaandFirstSteps {

    public static void main(String[] args) throws IOException {
        BufferedReader b = new BufferedReader(new InputStreamReader(System.in));

        int num = Integer.parseInt(b.readLine());
        String[] input = b.readLine().split(" ");

        int count = 0;
        List<Integer> list = new ArrayList<Integer>();

        int s = 0;
        int f = 0;
        if (input.length == 1) {
            System.out.println(1);
            System.exit(0);
        } else {
            for (int i = 1; i < num; i++) {
                f = Integer.parseInt(input[i - 1]);
                s = Integer.parseInt(input[i]);

                if (s >= f) {
                    count++;
                    if (i == num - 1) {
                        list.add(count+1);
                    }
                } else {
                    list.add(count+1);
                    count = 0;
                }

            }
        }

        Collections.sort(list);
        System.out.println(list.get(list.size() - 1));

    }

}
