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 *a*<sub class="lower-index">*i*</sub> money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence *a*<sub class="lower-index">*i*</sub>. 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!
The first line contains integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>).

The second line contains *n* integers *a*<sub class="lower-index">1</sub>,  *a*<sub class="lower-index">2</sub>,  ...,  *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).
def stdInput(type): # assists in getting inputs in different ways and returns the data needed
    if type == "TC": # test case count
        return int(input())
    if type == "SI": # spaced integers
        return [int(i) for i in input().split()]
    if type == "SS": # spaced strings
        return [i for i in input().split()]
    if type == "TCSI": # needs test case count, spaced integers
        fin = []
        for _ in range(stdInput("TC")):
            x = [int(i) for i in input().split()]
            fin.append(x)
        return fin
    if type == "TCSS": # needs test case count, spaced strings, gives string of each line
        fin = []
        for _ in range(stdInput("TC")):
            x = [i for i in input().split()]
            fin.append(x)
        return fin
    if type == "S": # single string
        return input()
    if type == "I": # single integer
        return int(input())

stdInput("I")
ints = stdInput("SI")

last = 0
sub = []
temp = []
for i in ints:
    if i >= last:
        temp.append(i)
    else:
        sub.append(temp)
        temp = [i]
    last = int(i)
sub.append(temp)

lengths = []
for i in sub:
    lengths.append(len(i))
print(max(lengths))