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.
# input()
# seq = {'max': 1, 'cur': 1, 'prev_el': None}
# for el in map(int, input().split()):
#     seq['cur'] = seq['cur'] + 1 if seq['prev_el'] and el >= seq['prev_el'] else 1
#     seq['prev_el'] = el
#     if seq['cur'] > seq['max']:
#         seq['max'] = seq['cur']
# print(seq['max'])


input()
max_seq, cur_seq, prev_el = 1, 1, None
arr = input().split()
for el in arr:
    el = int(el)
    cur_seq = cur_seq + 1 if prev_el and el >= prev_el else 1
    prev_el = el
    if cur_seq > max_seq:
        max_seq = cur_seq
print(max_seq)