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;

/**
 * Created by Derek on 1/8/2017.
 */
public class A580 {
    public static void main(String[] args) throws IOException {
        BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
        final int NUM = Integer.parseInt(stdin.readLine());
        String[] input = stdin.readLine().split(" ");
        int[] data = new int[NUM];

        int hi = 0;
        int fragment = 1;
        for (int i = 0; i < NUM; i++) {
            data[i] = Integer.parseInt(input[i]);
        }
        for (int i = 0; i < NUM-1; i++) {
            if(data[i+1]>=data[i]){
                fragment++;
            }
            else{
                hi = fragment>hi ? fragment:hi;
                fragment = 1;
            }
        }
        hi = fragment>hi ? fragment:hi;
        System.out.println(hi);
    }
}
