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.
"""
https://codeforces.com/problemset/problem/580/A
"""

class Solution:
    def check(self, n, steps):
        longest_max = 1
        curr_max = 1
        for i in range(1, n):
            if steps[i-1] <= steps[i]:
                curr_max += 1
                longest_max = max(longest_max, curr_max)
            else:
                longest_max = max(longest_max, curr_max)
                curr_max = 1
        print(longest_max)


if __name__ == "__main__":
    a = Solution()
    n = int(input())
    steps = []
    s = input()
    steps = s.split(' ')
    for i in range(n):
        steps[i] = int(steps[i])
    a.check(n, steps)
