output_description: Print the maximum number of times you can move.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      H_1 H_2 ... H_N
attempt: n = int(input())
  h_list = list(map(int, input().split()))
  h_list.append(10000000000)
  h_bigsmall_list = [0 for _ in range(n)]
  for i in range(n):
      if h_list[i] >= h_list[i + 1]:
          h_bigsmall_list[i] += 1
  h_bigsmall_str = ""
  for i in range(len(h_bigsmall_list)):
      h_bigsmall_str += str(h_bigsmall_list[i])
  strlist = h_bigsmall_str.split("0")
  max_len_element = max(strlist, key=len)
  print(len(max_len_element))
  
problem_description: Statement
  
  There are N squares arranged in a row from left to right.
  
  The height of the i-th square from the left is H_i.
  
  You will land on a square of your choice, then repeat moving to the adjacent
  square **on the right** as long as the height of the next square is not
  greater than that of the current square.
  
  Find the maximum number of times you can move.
samples: [{"input": "5\n    10 4 8 7 3", "output": "2\n    \n\nBy landing on the third square from the left, you can move to the right twice.\n\n* * *"}, {"input": "7\n    4 4 5 6 6 5 5", "output": "3\n    \n\nBy landing on the fourth square from the left, you can move to the right three\ntimes.\n\n* * *"}, {"input": "4\n    1 2 3 4", "output": "0"}]