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 read_input():
    number_of_days = int(input())
    sequence_input = [int(elem) for elem in input().split(" ")]
    return number_of_days, sequence_input


def check_max_value(value1, value2):
    return value1 if value1 > value2 else value2


if __name__ == "__main__":
    days, sequence = read_input()
    counter = 1
    max_counter = 1
    for index, element in enumerate(sequence):
        if index == 0:
            continue
        else:
            if element >= sequence[index-1]:
                counter += 1
            else:
                max_counter = check_max_value(counter, max_counter)
                counter = 1
    max_counter = check_max_value(counter, max_counter)
    print(max_counter)
