Buggy python submission (verdict: Runtime Error):
s=input()

t=input()
ans=0

for i in range(3):
    if s[i]==t[i]:
        ans+=1

print(ans)

Fixed submission:
n = int(input())
h = list(map(int, input().split()))

count = 0
count_list = [0]

for i in range(n-1):
	if(h[i+1] <= h[i]):
		count += 1
		count_list.append(count)
	else:
		count = 0

print(max(count_list))

Buggy python submission (verdict: Runtime Error):
import random

n = input()
n = int(n)

if n == 0:
	print(0)

elif n == 1:
	_ = input()
	print(0)

else:
	h = []

	for i in range(n):
		h.append(int(input()))

	rnd = random.randint(0, n)
	count = 0

	for i in range(rnd, n-1):
		if h[i+1] <= h[i]:
			count += 1

	print(count)

Fixed submission:
n = int(input())
h = list(map(int, input().split()))

count = 0
count_list = [0]

for i in range(n-1):
	if(h[i+1] <= h[i]):
		count += 1
		count_list.append(count)
	else:
		count = 0

print(max(count_list))

Buggy python submission (verdict: Runtime Error):
n = input()
n = int(n)

if n == 0:
	print(0)

elif n == 1:
	_ = input()
	print(0)

else:
	h = []

	for i in range(n):
		h.append(int(input()))

	rnd = int(n/2) - 1
	count = 0

	for i in range(rnd, n-1):
		if h[i+1] <= h[i]:
			count += 1

	print(count)

Fixed submission:
n = int(input())
h = list(map(int, input().split()))

count = 0
count_list = [0]

for i in range(n-1):
	if(h[i+1] <= h[i]):
		count += 1
		count_list.append(count)
	else:
		count = 0

print(max(count_list))

Buggy python submission (verdict: Runtime Error):
n=int(input())
ar=[]
c=0
m=0
cur=0
for i in range(0,n):
    ar.append(int(input()))
for i in range(0,n):
    cur=i
    for j in range(i+1,n):
        if(cur+1<n):
            if(ar[cur]>=ar[cur+1]):
                c+=1
                cur+=1
            else:
                break
    if(m<c):
        m=c
    c=0


print(m)

Fixed submission:
n = int(input())
h = list(map(int, input().split()))

count = 0
count_list = [0]

for i in range(n-1):
	if(h[i+1] <= h[i]):
		count += 1
		count_list.append(count)
	else:
		count = 0

print(max(count_list))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = input()
hs = [ int(i) for i in s.rsplit() ]

max = 0
for i in range(len(hs)):
    lmax = 0
    for k in range(1, len(hs)-i):
        if hs[i+k] <= hs[i+k-1]:
            lmax = lmax + 1
        else:
            break

        if lmax > max:
            max = lmax

print(max)

Fixed submission:
n = int(input())
h = list(map(int, input().split()))

count = 0
count_list = [0]

for i in range(n-1):
	if(h[i+1] <= h[i]):
		count += 1
		count_list.append(count)
	else:
		count = 0

print(max(count_list))

Buggy python submission (verdict: Runtime Error):
# find largest subsequence that aint increasing

n = int(input())
s = input()
hs = [ int(i) for i in s.rsplit() ]

for i in range(len(hs)):
    lmax = 0
    for k in range(1, len(hs)-i):
        if hs[i+k] <= hs[i+k-1]:
            lmax = lmax + 1
        else:
            break

    if lmax > max:
        max = lmax

print(max)

Fixed submission:
n = int(input())
h = list(map(int, input().split()))

count = 0
count_list = [0]

for i in range(n-1):
	if(h[i+1] <= h[i]):
		count += 1
		count_list.append(count)
	else:
		count = 0

print(max(count_list))

Buggy python submission (verdict: Runtime Error):
n=int(input())
h=[]
for i in range(n):
     h.append(int(input()))
count=flag=0 
for i in range(n-1): 
      if(h[i]>=h[i+1]):
        flag+=1
      else :
        count=flag if(flag>count) else count
        flag=0
print(count)

Fixed submission:
n = int(input())
h = list(map(int, input().split()))

count = 0
count_list = [0]

for i in range(n-1):
	if(h[i+1] <= h[i]):
		count += 1
		count_list.append(count)
	else:
		count = 0

print(max(count_list))

Buggy python submission (verdict: Runtime Error):
# Find largest subseq that is 'not increasing' and print its length -1

n = int(input())
hs = [ int(i) for i in input().rsplit ]

# Now find largest subsequence
# what the builtin fn you have for it python guys???????

a = 0; b = 0; # Denote first and last elements of sequence respectively
t1 = 0; t2 = 0;

# Largest subsequence is not very trivial dude
# I really need a pen and paper

max = 0
for i in range(len(hs)):
    localmax = 0
    for k in range (1, len(hs) - i):
        if hs[i+k] <= hs[i+k-1]:
            localmax = localmax + 1
        else:
            break

    if localmax > max:
        max = localmax

print(max)

Fixed submission:
n = int(input())
h = list(map(int, input().split()))

count = 0
count_list = [0]

for i in range(n-1):
	if(h[i+1] <= h[i]):
		count += 1
		count_list.append(count)
	else:
		count = 0

print(max(count_list))

Buggy python submission (verdict: Runtime Error):
n = int(input())
values = [float(s) for s in input().split(" ")]

start = 0
ans = 0

for i in range(1,n):
    if values[i] <= values[i+1]:
        start = i
    ans = max(ans,i-start)
print(ans)


Fixed submission:
n = int(input())
h = list(map(int, input().split()))

count = 0
count_list = [0]

for i in range(n-1):
	if(h[i+1] <= h[i]):
		count += 1
		count_list.append(count)
	else:
		count = 0

print(max(count_list))