Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
i = 0
count = 0
ans = []
while i < n - 1:
  if h[i] < h[i + 1]:
    ans.append(count)
    count = 0
  else:
    count += 1
  i += 1
print(max(ans))

Fixed submission:
n = int(input())
h = list(map(int, input().split()))
i = 0
count = 0
ans = []
while i < n - 1:
  if h[i] < h[i + 1]:
    ans.append(count)
    count = 0
  else:
    count += 1
  i += 1
ans.append(count)
print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
x = []
i = 0
ans = 0
while i != n - 1:
  while i != n - 1:
    if h[i] < h[i + 1]:
      break
    ans += 1
    i += 1
  x.append(ans)
print(max(x))

Fixed submission:
n = int(input())
h = list(map(int, input().split()))
i = 0
count = 0
ans = []
while i < n - 1:
  if h[i] < h[i + 1]:
    ans.append(count)
    count = 0
  else:
    count += 1
  i += 1
ans.append(count)
print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
h.append(1000000000)
ans = []
x = 0
for i in range(n):
  ans.append(0)
  while h[i] - h[i + 1] >= 0:
    ans[x] += 1
    i += 1
  x += 1
print(max(ans))


Fixed submission:
n = int(input())
h = list(map(int, input().split()))
i = 0
count = 0
ans = []
while i < n - 1:
  if h[i] < h[i + 1]:
    ans.append(count)
    count = 0
  else:
    count += 1
  i += 1
ans.append(count)
print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
h.append(1000000000)
ans = []
x = 0
for i in range(n):
  ans.append(0)
  while h[i] - h[i + 1] >= 0:
    ans[x] += 1
    i += 1
  x += 1
print(max(ans))


Fixed submission:
n = int(input())
h = list(map(int, input().split()))
i = 0
count = 0
ans = []
while i < n - 1:
  if h[i] < h[i + 1]:
    ans.append(count)
    count = 0
  else:
    count += 1
  i += 1
ans.append(count)
print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
h.append(inf)
ans = []
x = 0
for i in range(n):
  ans.append(0)
  while h[i] - h[i + 1] >= 0:
    ans[x] += 1
    i += 1
  x += 1
print(max(ans))


Fixed submission:
n = int(input())
h = list(map(int, input().split()))
i = 0
count = 0
ans = []
while i < n - 1:
  if h[i] < h[i + 1]:
    ans.append(count)
    count = 0
  else:
    count += 1
  i += 1
ans.append(count)
print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
h.append(inf)
ans = []
x = 0
for i in range(n - 1):
  ans.append(0)
  while h[i] - h[i + 1] >= 0:
    ans[x] += 1
    i += 1
  x += 1
print(max(ans))

Fixed submission:
n = int(input())
h = list(map(int, input().split()))
i = 0
count = 0
ans = []
while i < n - 1:
  if h[i] < h[i + 1]:
    ans.append(count)
    count = 0
  else:
    count += 1
  i += 1
ans.append(count)
print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
ans = []
x = 0
for i in range(n):
  ans.append(0)
  while h[i] >= h[i + 1]:
    ans[x] += 1
    i += 1
  x += 1
print(max(ans))


Fixed submission:
n = int(input())
h = list(map(int, input().split()))
i = 0
count = 0
ans = []
while i < n - 1:
  if h[i] < h[i + 1]:
    ans.append(count)
    count = 0
  else:
    count += 1
  i += 1
ans.append(count)
print(max(ans))

Buggy python submission (verdict: Runtime Error):
h = [int(input()) for _ in range(int(input()))]
ans = []
x = 0
for i in range(len(h)):
  ans.append(0)
  while h[i] >= h[i + 1]:
    ans[x] += 1
    i += 1
  x += 1
print(max(ans))

Fixed submission:
n = int(input())
h = list(map(int, input().split()))
i = 0
count = 0
ans = []
while i < n - 1:
  if h[i] < h[i + 1]:
    ans.append(count)
    count = 0
  else:
    count += 1
  i += 1
ans.append(count)
print(max(ans))

Buggy python submission (verdict: Runtime Error):
N=int(input())
H=list(map(int,input().split()))
a=[0]*N
for i in range(1,N):
	if(H[i-1]>=H[i]):
		a[i]=a[i-1]+1

import numpy as np
print(np.max(a))


Fixed submission:
N=int(input())
H=list(map(int,input().split()))
a=[0]*N
max_i=0
for i in range(1,N):
	if(H[i-1]>=H[i]):
		a[i]=a[i-1]+1
		if(max_i<a[i]):max_i=a[i]
print(max_i)