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 find_max_non_decreasing_subsegment_length(n, numbers):
    max_length = 1  # Minimum length is 1 (for a single element)

    current_length = 1
    for i in range(1, n):
        if numbers[i] >= numbers[i - 1]:
            # Current number is greater than or equal to the previous number
            current_length += 1
        else:
            # Current number is smaller than the previous number
            max_length = max(max_length, current_length)  # Update the maximum length
            current_length = 1  # Reset the current length

    # Check if the last subsegment is the longest
    max_length = max(max_length, current_length)

    return max_length


# Read input values
n = int(input())
numbers = list(map(int, input().split()))

# Find the length of the maximum non-decreasing subsegment
result = find_max_non_decreasing_subsegment_length(n, numbers)

# Output the result
print(result)

	  		 	  			 	  	  	   		 	 			