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())
a_str = input()
a = list(map(lambda x: int(x), a_str.strip().split(' ')))

if n == 0:
    print(0)
    exit()

if n == 1:
    print(1)
    exit()

fix, f, s, nd_len = (0, 0, 1, 0)
while s < len(a):
    if a[f] <= a[s]:
        s += 1
        f += 1
    else:
        local_nd_len = s - fix
        if local_nd_len > nd_len:
            # print(str(fix) + "," + str(s) + "," + str(local_nd_len))
            nd_len = local_nd_len
        fix = s
        f = fix
        s = fix + 1

if (s - fix) > nd_len:
    # print(str(fix) + "," + str(s) + "," + str(s - fix))
    nd_len = s - fix

print(nd_len)
