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.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.PrintWriter;
import java.util.Deque;
import java.util.LinkedList;
import java.util.Scanner;

public class F {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));
        int n = sc.nextInt();
        int a[] = new int [n];
        for (int i = 0; i < n; i++) {
           a[i] = sc.nextInt();
        }
        int max = a[0];
        int k = 0;
        int b[] = new int [n];
        int length = 1;
        b[0] = length;
        for (int i = 1; i <n ; i++) {
            if(a[i]>=max){
                length++;
                if(a[i]>max){
                    max = a[i];
                }
               if(i == n-1){
                   b[k] = length;
               }
            }else{
                max = a[i];
                b[k]= length;
                length = 1;
                k++;
            }
        }
        int max2 = b[0];
        for (int i = 1; i < n; i++) {
            if(b[i]>max2){
                max2 = b[i];
            }
        }
        System.out.print(max2);
    }
}