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.PrintWriter;
import java.math.BigInteger;
import java.util.*;

/**
 * Created by Roland on 10/7/2015.
 */
public class NextRound {

    private Scanner scanner = new Scanner(System.in);
    private PrintWriter writer = new PrintWriter(System.out);
    private static int[] list;

    public int count(){

        int n = scanner.nextInt();

        int prevValue = scanner.nextInt();
        int maxRange = Integer.MIN_VALUE;
        int currRange = 1;
        for (int i = 0; i < n-1; i++) {
            int currentValue = scanner.nextInt();
            if(prevValue <= currentValue){
                currRange++;
            } else {
                if(currRange > maxRange){
                    maxRange = currRange;
                }
                currRange = 1;
            }
            prevValue = currentValue;
        }
        if(currRange > maxRange){
            maxRange = currRange;
        }

        return maxRange;
    }



    public static void main(String[] args){

        NextRound ob = new NextRound();
        System.out.println(ob.count());


    }
}
