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.
"""Problem A - Kefa and First Steps.

http://codeforces.com/problemset/problem/580/a

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.

"""
import logging


fmt = '%(levelname)s - %(name)s (line:%(lineno)s) - %(message)s'
formatter = logging.Formatter(fmt)

ch = logging.StreamHandler()
ch.setLevel(logging.ERROR)
ch.setFormatter(formatter)

logger = logging.getLogger('kefa_and_first_steps')
logger.setLevel(logging.ERROR)
logger.addHandler(ch)


def solve(seq):
    msf = count = 1
    for i in range(1, len(seq)):
        if seq[i - 1] > seq[i]:
            count = 0
        count += 1
        msf = max(msf, count)
    return msf


def main():
    _ = input()
    seq = [int(x) for x in input().strip().split()]
    result = solve(seq)
    print(result)


if __name__ == '__main__':
    main()
