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.
class pair:
    def __init__(self, value, index):
        self.value = int(value)
        self.index = int(index)


n = int(input())
day = [int(day) for day in input().split()]
list_day = []
x = pair(day[len(day) - 1], len(day) - 1)
list_day.append(x)
max_decreasing = 0
for i in range(len(day) - 2, -1, -1):
    if list_day[len(list_day) - 1].value >= day[i] or len(list_day) == 0:
        x = pair(day[i], i)
        list_day.append(x)
        # for i in list_day:
        #     print(i.value, i.index)
        continue
    else:
        if day[i] > list_day[len(list_day) - 1].value:
            while len(list_day) != 0:
                x = list_day.pop()
                max_decreasing = max(max_decreasing, x.index - i)
        x = pair(day[i], i)
        list_day.append(x)
tmp = list_day[0]
max_decreasing = max(max_decreasing, tmp.index + 1)
print(max_decreasing)
