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,m=[int(a) for a in input().split()]
# arr=[int(a) for a in input().split()]
# save=[]
# for thing in range(m):
#   save.append(str(len(set(arr[int(input())-1:]))))
# print('\n'.join(save))

# n,m=[int(a) for a in input().split()]
# save={}
# later=[]
# for thing in range(m):
#   a,b=[str(a) for a in input().split()]
#   if len(a)>len(b):
#     save[a]=b;
#   else:
#     save[a]=a
# f=input().split()

# for word in f:
#   later.append(save.get(word))
# print(' '.join(later))


_=int(input())
hold=[]
a=[int(a) for a in input().split()]
prev=0
counter=0
for nums in a:
  if nums>=prev:
    counter+=1
  else:
    hold.append(counter)
    counter=1
  prev=nums
hold.append(counter)

hold.sort()
hold.reverse()
print(hold[0])


  