Buggy python submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(x, tmp)
  else:
    tmp = 0
    
print(s)

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = list(map(int, input().split()))
max_count = 0
for i in range(0, N-1):
  tmp_count = 0
  for j in range(i, N-1):
    if H[j] >= H[j+1]:
      tmp_count=tmp_count+1
    else:
      break
  if tmp_count>max_count:
    max_count=tmp_count
  if max_count >= N-i:
    break
print(max_count)

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = list(map(int, input().split()))
max_count = 0
for i in range(0, N-1):
  tmp_count = 0
  for j in range(i, N-1):
    if H[j] >= H[j+1]:
      tmp_count=tmp_count+1
    else:
      break
  if tmp_count>max_count:
    max_count=tmp_count
print(max_count)

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

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

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

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

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

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

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

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

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

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

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

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

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

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

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

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

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

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


Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

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

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

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

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)

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

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
tmp = 0
s = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    tmp += 1
    s = max(s, tmp)
  else:
    tmp = 0
    
print(s)