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.

def convertString(values, integers):
    lastDigit = '0'
    for value in values:
        if value != ' ':
            newInt = int(value)
            integers.append(newInt)


def main():
    n = input()
    # values = input()
    auxCount = 0
    lastValue = 0
    subsegments = []
    integers = []
    # print(n)

    values = raw_input().split(' ')
    # print(numbers)
    convertString(values, integers)
    # # print(values)
    # print(integers)


    for value in integers:
        # print(value)
        if int(value) >= lastValue:
            auxCount = auxCount + 1
            lastValue = value
            # print("Count is", auxCount)
            # print("Last value is", lastValue)
        else:
            subsegments.append(auxCount)
            lastValue = value
            auxCount = 1
    subsegments.append(auxCount)
    # print(subsegments)
    print(max(subsegments))

main()
