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.
n = int(input())
if n>=1 and n<=100000:
    a = list(map(int, input().split()))
    i = len(a)
    check = 1
    if i==n:
        for p in a:
            if p < 1 or p > 1000000000:
                check = 0
                break

        if check == 1:
            if i==1:
                print("1")
            else:
                num = 0
                temp = 0
                final = 0
                j = 0
                while j<i:
                    if a[j] <= a[j+1]:
                        num += 1

                    else:
                        if num != 0:
                            temp = num + 1
                            if temp>final:
                                final = temp
                                temp = 0
                            num = 0

                    if j == i-2:
                        if a[j] <= a[j + 1]:
                            num += 1
                        break

                    j += 1

                d = 0
                while d < i-1:
                    if a[d] > a[d+1]:
                        decrease = 0
                    else:
                        decrease = 1
                        break
                    d += 1
                if decrease == 0:
                    print("1")

                else:
                    if final > num:
                        print(final)
                    else:
                        print(num)