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 main() -> None :
  print(max_Length_Of_None_Decreasing_Segment(user_Inputs()))


def max_Length_Of_None_Decreasing_Segment(array: list[int]) -> int :
  return max_Length_Of_Success_Values(is_Next_Number_None_Decreasings(array), True) + 1

def is_Next_Number_None_Decreasings(array: list[int]) -> list[bool] :
  return [array[index] <= array[index+1] for index in range(len(array)-1)]

def max_Length_Of_Success_Values(array: list[int], success_value: int) -> int :
  result:int = 0
  success_length:int = 0
  
  for e in array :
    if e != success_value :
      success_length = 0 
      continue

    success_length += 1 
    result = max(result, success_length)
  
  return result


def user_Inputs() -> list[int] :
  ignore_Line()
  return input_Array()

def input_Array() -> list[int] :
  return list(map(int, input().split()))

def ignore_Line() -> None :
  input()


main()