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 solution(n, a):
    if a == sorted(a):
      return len(a)

    lengths_of_subsegments = []

    def find_subsegment_length(a, start):
        count = 1
        for i in range(start, n):
            if i+1 < n:
                if a[i] <= a[i+1]:
                    count += 1
                else:
                    lengths_of_subsegments.append(count)
                    find_subsegment_length(a, i+1)
                    break
    find_subsegment_length(a, 0)
    return(max(lengths_of_subsegments))


print(solution(int(input()), list(map(int, input().split()))))