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, a = input().split()

a = input()
#k = input()
#n = input()
#k = [i for i in k]
#k = [input().split() for i in range(int(a))]
n = input().split()

#n = [i for i in n[0]]

'''
cont = [
'a', 'b', 'c', 'd', 'e', 'f', 'g',
'h', 'i', 'j', 'k', 'l', 'm', 'n',
'o', 'p', 'q', 'r', 's', 't', 'u',
'v', 'w', 'x', 'y', 'z'
]
'''
#n = a[1]
#a = a[0]

cnt = 0
max_size = 0
i_l = 0
n = list(map(int, n))
for i in n:
    if i >= i_l:
        cnt += 1
        if max_size < cnt:
            max_size = cnt
    else:
        cnt = 1
    i_l = i
if max_size < cnt:
    max_size = cnt
print(max_size)