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.Scanner;

public class KefaAndFirstSteps
{
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();
        long[] money = new long[(int)n];
        for(int i = 0; i < n; i++)
        {
            money[i] = sc.nextLong();
        }
        long len = subsegment_len(money);
        System.out.print(len);
        sc.close();
    }

    // function to tell the maximum length of increasing subsegment
    public static long subsegment_len(long[] money_)
    {
        long count = 1;
        long max_ = 1;

        for(int i = 0; i < money_.length; i++)
        {
            if(i > 0)
            {
                if(money_[i] >= money_[i-1])
                {
                    count++;
                    max_ = Math.max(max_, count);
                }
                else
                {
                    count = 1;
                }
            }
        }
        return max_;
    }
}