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.
_, list_in, list_re, list_out = input(), [int(x) for x in input().strip().split()], [(0, 0)], []
for x in range(len(list_in)-1):
    if list_in[x] > list_in[x+1]:
        list_re.append((x, x+1))
list_re.append((len(list_in)-1, len(list_in)-1))
for x in range(len(list_re)-1):
    if list_re[x+1][0] - list_re[x][-1] >= 0:
        list_out.append(list_re[x+1][0] - list_re[x][-1]+1)
if len(list_out):
    print(max(list_out))
else:
    print(len(list_in))