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.
# 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 a i money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence a i. 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 a 1, a 2, ..., a n(1 ≤ a i ≤ 109).

# Output
# Print a single integer — the length of the maximum non-decreasing subsegment of sequence a.

# Examples
# inputCopy
# 6
# 2 2 1 3 4 1
# outputCopy
# 3
# inputCopy
# 3
# 2 2 9
# outputCopy
# 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())
arr = list(map(int, input().split(' ')))
m=1
i=0
while i<n-1 :
    j=i+1
    while(j<n):
        if arr[j-1]<=arr[j]:
            m = max(m, j-i+1)
            j+=1
        else:
            break
    i=j

print(m)
            
