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: number = int(input())
  heights = list(map(int, input().split()))
  plusminus = []
  answerlist = [0]
  q = 0
  for i in range(number - 1):
      if i != number - 2 and heights[i] >= heights[i + 1]:
          q += 1
      elif i == number - 2 and heights[i] >= heights[i + 1]:
          q += 1
          answerlist.append(q)
      else:
          answerlist.append(q)
          q = 0
  print(max(answerlist))
  
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"}]