Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
a = []
ans = []
b = set(h)
if n == 0:
  print(0)
elif len(b) == 1:
  print(len(h)-1)
else:


  for i in range(n-1):
    if h[i] < h[i+1]:
      a.append(i+1)

  

  ans.append(a[0]-1)
  for i in range(len(a)-1):
    ans.append((a[i+1] - a[i])-1)
  ans.append((len(h) - a[len(a)-1])-1)
  if ans == []:
    print(0)
  else:
    print(max(ans))

Fixed submission:
n = int(input())
h = list(map(int, input().split()))
a = []
ans = []
b = set(h)
if n == 0:
  print(0)
elif len(b) == 1:
  print(len(h)-1)
else:


  for i in range(n-1):
    if h[i] < h[i+1]:
      a.append(i+1)

  
  if a == []:
    print(len(h)-1)
  else:
    ans.append(a[0])
    ans[0] -= 1
    for i in range(len(a)-1):
      ans.append((a[i+1] - a[i])-1)
    ans.append((len(h) - a[len(a)-1])-1)
    if ans == []:
      print(0)
    else:
      print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
a = []
ans = []
b = set(h)
if len(b) == 1:
  print(len(h)-1)
elif n == 0:
  print(0)
else:


  for i in range(n-1):
    if h[i] < h[i+1]:
      a.append(i+1)

  

  ans.append(a[0]-1)
  for i in range(len(a)-1):
    ans.append((a[i+1] - a[i])-1)
  ans.append((len(h) - a[len(a)-1])-1)
  if ans == []:
    print(0)
  else:
    print(max(ans))

Fixed submission:
n = int(input())
h = list(map(int, input().split()))
a = []
ans = []
b = set(h)
if n == 0:
  print(0)
elif len(b) == 1:
  print(len(h)-1)
else:


  for i in range(n-1):
    if h[i] < h[i+1]:
      a.append(i+1)

  
  if a == []:
    print(len(h)-1)
  else:
    ans.append(a[0])
    ans[0] -= 1
    for i in range(len(a)-1):
      ans.append((a[i+1] - a[i])-1)
    ans.append((len(h) - a[len(a)-1])-1)
    if ans == []:
      print(0)
    else:
      print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
a = []
ans = []
b = set(h)
if len(b) == 1:
  print(len(h))
else:


  for i in range(n-1):
    if h[i] < h[i+1]:
      a.append(i+1)

  

  ans.append(a[0]-1)
  for i in range(len(a)-1):
    ans.append((a[i+1] - a[i])-1)
  ans.append((len(h) - a[len(a)-1])-1)
  if ans == []:
    print(0)
  else:
    print(max(ans))

Fixed submission:
n = int(input())
h = list(map(int, input().split()))
a = []
ans = []
b = set(h)
if n == 0:
  print(0)
elif len(b) == 1:
  print(len(h)-1)
else:


  for i in range(n-1):
    if h[i] < h[i+1]:
      a.append(i+1)

  
  if a == []:
    print(len(h)-1)
  else:
    ans.append(a[0])
    ans[0] -= 1
    for i in range(len(a)-1):
      ans.append((a[i+1] - a[i])-1)
    ans.append((len(h) - a[len(a)-1])-1)
    if ans == []:
      print(0)
    else:
      print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
a = []
ans = []
for i in range(n-1):
  if h[i] < h[i+1]:
    a.append(i+1)

  

ans.append(a[0]-1)
for i in range(len(a)-1):
  ans.append((a[i+1] - a[i])-1)
ans.append((len(h) - a[len(a)-1])-1)
if a == []:
  print(0)
else:
  print(max(ans))

Fixed submission:
n = int(input())
h = list(map(int, input().split()))
a = []
ans = []
b = set(h)
if n == 0:
  print(0)
elif len(b) == 1:
  print(len(h)-1)
else:


  for i in range(n-1):
    if h[i] < h[i+1]:
      a.append(i+1)

  
  if a == []:
    print(len(h)-1)
  else:
    ans.append(a[0])
    ans[0] -= 1
    for i in range(len(a)-1):
      ans.append((a[i+1] - a[i])-1)
    ans.append((len(h) - a[len(a)-1])-1)
    if ans == []:
      print(0)
    else:
      print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
a = []
ans = []
for i in range(n-1):
  if h[i] < h[i+1]:
    a.append(i+1)

  

ans.append(a[0]-1)
for i in range(len(a)-1):
  ans.append((a[i+1] - a[i])-1)
ans.append((len(h) - a[len(a)-1])-1)
if ans == []:
  print(0)
else:
  print(max(ans))

Fixed submission:
n = int(input())
h = list(map(int, input().split()))
a = []
ans = []
b = set(h)
if n == 0:
  print(0)
elif len(b) == 1:
  print(len(h)-1)
else:


  for i in range(n-1):
    if h[i] < h[i+1]:
      a.append(i+1)

  
  if a == []:
    print(len(h)-1)
  else:
    ans.append(a[0])
    ans[0] -= 1
    for i in range(len(a)-1):
      ans.append((a[i+1] - a[i])-1)
    ans.append((len(h) - a[len(a)-1])-1)
    if ans == []:
      print(0)
    else:
      print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
a = []
ans = []
for i in range(n-1):
  if h[i] < h[i+1]:
    a.append(i+1)

ans.append(a[0]-1)
for i in range(len(a)-1):
  ans.append((a[i+1] - a[i])-1)
ans.append((len(h) - a[len(a)-1])-1)
print(max(ans))

Fixed submission:
n = int(input())
h = list(map(int, input().split()))
a = []
ans = []
b = set(h)
if n == 0:
  print(0)
elif len(b) == 1:
  print(len(h)-1)
else:


  for i in range(n-1):
    if h[i] < h[i+1]:
      a.append(i+1)

  
  if a == []:
    print(len(h)-1)
  else:
    ans.append(a[0])
    ans[0] -= 1
    for i in range(len(a)-1):
      ans.append((a[i+1] - a[i])-1)
    ans.append((len(h) - a[len(a)-1])-1)
    if ans == []:
      print(0)
    else:
      print(max(ans))