Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N = int(input())
import math
def is_prime(n):
  if n == 1: return False
  for k in range(2, int(math.sqrt(n)) + 1):
    if n % k == 0:
      return False
  return True
if is_prime(N):
  print(N-1)
else:
  a = np.floor(math.sqrt(N))
  while True:
    if N%a==0:
      break
      a=a-1
      b=N/a
      print(int(a+b-2))

Fixed submission:
N = int(input())
import math
def is_prime(n):
  if n == 1: return False
  for k in range(2, int(math.sqrt(n)) + 1):
    if n % k == 0:
      return False
  return True
if is_prime(N):
  print(N-1)
else:
  a = math.floor(math.sqrt(N))
  while True:
    if N%a==0:
      break
    a=a-1
  print(int(a+N/a-2))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
import numpy as np

a = np.floor(np.sqrt(N))
while True:
  if N%a==0:
    break
  a=a-1
b=N/a
print(int(a+b-2))

Fixed submission:
N = int(input())
import math
def is_prime(n):
  if n == 1: return False
  for k in range(2, int(math.sqrt(n)) + 1):
    if n % k == 0:
      return False
  return True
if is_prime(N):
  print(N-1)
else:
  a = math.floor(math.sqrt(N))
  while True:
    if N%a==0:
      break
    a=a-1
  print(int(a+N/a-2))
Buggy python submission (verdict: Runtime Error):
a, b, x = map(int, input().split())
print(np.arctan(a*b*b/2/x)*180/np.pi)

Fixed submission:
a, b, x = map(int, input().split())
import numpy as np
if b*a*a/2>x:
  print(np.arctan(a*b*b/2/x)*180/np.pi)
else:
  y=2*x/(a*a) - b
  z = b-y
  print(np.arctan(z/a)*180/np.pi)

Buggy python submission (verdict: Runtime Error):
a, b, x = map(int, input().split())
np.arctan(a*b*b/2/x)*180/np.pi

Fixed submission:
a, b, x = map(int, input().split())
import numpy as np
if b*a*a/2>x:
  print(np.arctan(a*b*b/2/x)*180/np.pi)
else:
  y=2*x/(a*a) - b
  z = b-y
  print(np.arctan(z/a)*180/np.pi)
Buggy python submission (verdict: Runtime Error):
N = int(input())
L = list(map(int, input().split()))

L.sort()
result = 0
for i in range(N - 2):
    for j in range(i + 1, N - 1):
        result += bisect_left(L, L[i] + L[j]) - j - 1
print(result)

Fixed submission:
from bisect import bisect_left

N = int(input())
L = list(map(int, input().split()))

L.sort()
result = 0
for i in range(N - 2):
    for j in range(i + 1, N - 1):
        result += bisect_left(L, L[i] + L[j]) - j - 1
print(result)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
d = sorted(list(map(int, input().split())))
res = 0
for i in range(0, N - 2):
    for j in range(i + 1, N - 1):
        tmp = d[i] + d[j]
        for k in range(j + 1, N):
            if tmp > d[k]:
                res = res + 1
            else:
                break
print(res)

Fixed submission:
from bisect import bisect_left

N = int(input())
L = list(map(int, input().split()))

L.sort()
result = 0
for i in range(N - 2):
    for j in range(i + 1, N - 1):
        result += bisect_left(L, L[i] + L[j]) - j - 1
print(result)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
d = sorted(list(map(int, input().split())))
ans = []
for i in range(0, N - 2):
    for j in range(i + 1, N - 1):
        for k in range(j + 1, N):
            if (d[i] < (d[j] + d[k])) & (d[j] < (d[i] + d[k])) & (d[k] < (d[j] + d[i])):
                ans.append(sorted([d[i], d[j], d[k]]))
            else:
                break
seen = []
ans = [x for x in ans if x not in seen and not seen.append(x)]
print(len(ans))

Fixed submission:
from bisect import bisect_left

N = int(input())
L = list(map(int, input().split()))

L.sort()
result = 0
for i in range(N - 2):
    for j in range(i + 1, N - 1):
        result += bisect_left(L, L[i] + L[j]) - j - 1
print(result)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
d = list(map(int, input().split()))
ans = []
for i in range(0, N - 2):
    for j in range(i + 1, N - 1):
        for k in range(j + 1, N):
            if (d[i] < (d[j] + d[k])) & (d[j] < (d[i] + d[k])) & (d[k] < (d[j] + d[i])):
                ans.append(sorted([d[i], d[j], d[k]]))

seen = []
ans = [x for x in ans if x not in seen and not seen.append(x)]
print(len(ans))

Fixed submission:
from bisect import bisect_left

N = int(input())
L = list(map(int, input().split()))

L.sort()
result = 0
for i in range(N - 2):
    for j in range(i + 1, N - 1):
        result += bisect_left(L, L[i] + L[j]) - j - 1
print(result)
Buggy python submission (verdict: Runtime Error):
import numpy as np
K = list(map(int, input().split()))[1]
h = list(map(int, input().split()))
print(sum(np.array(h)>=K)

Fixed submission:
import numpy as np
K = list(map(int, input().split()))[1]
h = list(map(int, input().split()))
print(sum(np.array(h)>=K))
Buggy python submission (verdict: Runtime Error):
import numpy as np

N = int(input())
ans1 = 1
ans2 = 1
for _ in range(N):
  i1, i2 = list(map(int, input().split()))
  n = max(np.ceil(ans1/i1), np.ceil(ans2/i2))
  ans1 = i1 * n
  ans2 = i2 * n
print(int(ans1+ans2))

Fixed submission:
N = int(input())
x, y = 1, 1
for i in range(N):
  a, b = map(int, input().split())
  mul = max((x+a-1)//a, (y+b-1)//b)
  x = mul*a
  y = mul*b
print(x+y)
Buggy python submission (verdict: Time Limit Exceeded):
N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
X = max(max(x), A)

dp=[[[0 for k in range(N*X+1)] for j in range(N+1)] for i in range(N+1)]

ans = 0
for j in range(N+1):
  for k in range(N+1):
    for s in range(N*X+1):
      if j==0 and k==0 and s==0:
        dp[j][k][s]=1
      elif j>=1 and s<x[j-1]:
        dp[j][k][s] = dp[j-1][k][s]
      elif j>=1 and k>=1 and s>=x[j-1]:
        dp[j][k][s] = dp[j-1][k][s] + dp[j-1][k-1][s-x[j-1]]
      else:
        dp[j][k][s] = 0
      if j==N and s==k*A:
        ans = ans + dp[j][k][s]
print(ans-1)


Fixed submission:
N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
X = max(max(x), A)

dp=[[[0 for k in range(N*X+1)] for j in range(N+1)] for i in range(N+1)]

ans = 0
for j in range(N+1):
  for k in range(N+1):
    for s in range(N*X+1):
      if j==0 and k==0 and s==0:
        dp[j][k][s]=1
      elif j>=1 and s<x[j-1]:
        dp[j][k][s] = dp[j-1][k][s]
      elif j>=1 and k>=1 and s>=x[j-1]:
        dp[j][k][s] = dp[j-1][k][s] + dp[j-1][k-1][s-x[j-1]]
      else:
        dp[j][k][s] = 0
      if j==N and s==k*A:
        ans = ans + dp[j][k][s]
print(ans-1)
Buggy python submission (verdict: Runtime Error):
n = input()
a = list(map(int,input().split()))
ans = 'APPROVED'
 
for i in a:
  if i % 2 == 0:
    if i % 3 != 0:
      ans = 'DENIED'
      break
    elif i % 5 != 0:
      ans = 'DENIED'
      break
 
 
print(ans)

Fixed submission:
n = list(map(int,input().split()))
ans = 'No'
 
if len(set(n)) == 2:
  ans = 'Yes'
 
print(ans)
Buggy python submission (verdict: Runtime Error):
s = list(map(input().split()))
a = list(map(int,input().split()))
u = input()


if s[0] == u:
  a[0] -= 1
else:
  a[1] -= 1

print(str(a[0]) + " " + str(a[1]))

Fixed submission:
s = input().split()
a = list(map(int,input().split()))
u = input()


if s[0] == u:
  a[0] -= 1
else:
  a[1] -= 1

print(str(a[0]) + " " + str(a[1]))
Buggy python submission (verdict: Runtime Error):
import fractions

h,a=map(int,input().split())

print(fractions.ceil(h,a))

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

if n[0] % n[1] != 0:
  t = 1

print(n[0] // n[1] + t)
Buggy python submission (verdict: Runtime Error):
n,m = list(map(int,input().split()))
ac = 0
wa = 0
y = [0] * n
z = [0] * n

for _ in range(m):
  p,s = input().split()
  p = int(p)
  if not y[p] and s == 'WA':
    z[p] += 1
  elif not y[p] and s == 'AC':
    ac += 1
    y[p] += 1

for i in range(m):
  if y[i]:
    wa += z[i]

print(ac,wa)

Fixed submission:
n,m = list(map(int,input().split()))
ac = 0
wa = 0
y = {i:0 for i in range(1,n+1)}
z = {i:0 for i in range(1,n+1)}

for _ in range(m):
  p,s = input().split()
  p = int(p)
  if not y[p] and s == 'WA':
    z[p] += 1
  elif not y[p] and s == 'AC':
    ac += 1
    y[p] += 1

for i in range(1,n+1):
  if y[i]:
    wa += z[i]

print(ac,wa)
Buggy python submission (verdict: Time Limit Exceeded):
l = list(map(int,input().split()))

for i in range(l[2]):
  if l[0] >= 1:
    l[0] = l[0] - 1
  else:
    if l[1] >= 1:
      l[1] = l[1] - 1
    else:
      break

print(str(l[0]) + " " + str(l[1])) 

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

l[0] = l[0] - l[2]

if l[0] < 0:
  l[1] = l[1] + l[0]
  l[0] = 0
  if l[1] < 0:
    l[1] = 0

print(str(l[0]) + " " + str(l[1]))
Buggy python submission (verdict: Runtime Error):
n = list(map(int,input().split()))
ans = 0
if n[1] % 2 == 0 and n[2] % 2 == 0:
  ans = n[2] - n[1]
  print(ans//2)
else:
  if n[0] - n[2] < n[1] - 1:
    ans = n - n[1]
  else:
    ans = n[2] - 1
  print(ans)

Fixed submission:
n = list(map(int,input().split()))
ans = 0
if (n[2] - n[1]) % 2 == 0:
  ans = (n[2] - n[1]) // 2
else:
  ans = min(n[0] - n[2] + 1, n[1] - 1 + 1)
  ans += abs(n[2] - n[1] - 1) // 2

print(ans)
Buggy python submission (verdict: Runtime Error):
import math

s = list(map(int,input().split()))

print((s[0] * s[1]) // math.gcd(s[0], s[1]))



Fixed submission:
import fractions

s = list(map(int,input().split()))

print((s[0] * s[1]) // fractions.gcd(s[0], s[1]))

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

s = list(map(int,input().split()))

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

print(lcm(s[0], s[1]))



Fixed submission:
import fractions

s = list(map(int,input().split()))

print((s[0] * s[1]) // fractions.gcd(s[0], s[1]))
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))

num = 1
ans = 0

if i in range(n):
  if num == a[i]:
    num += 1

if num == 1:
  ans = -1
else:
  ans = n - num + 1

print(ans)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
num = 1
ans = 0
 
for i in range(n):
  if num == a[i]:
    num += 1
 
if num == 1:
  ans = -1
else:
  ans = n - num + 1
 
print(ans)
Buggy python submission (verdict: Runtime Error):
import codecs

n = input()
s = input()

codecs.decode(s,'rot'+ n)

Fixed submission:
n = int(input())
s = list(input())
l = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
a = []

for i in s:
  t = l.index(i)+n
  if t < 26:
    a.append(l[t])
  else:
    a.append(l[t-26])

print("".join(a))
Buggy python submission (verdict: Runtime Error):
kazu = int(input())
suji = input().split()

l_si_i = [int(s) for s in suji]

for i in range(kazu):
    if i == 0:
        if l_si_i[i+1] - l_si_i[i] < -1:
            print('No')
            exit()
        elif l_si_i[i+1] - l_si_i[i] == -1:
            l_si_i[i] = l_si_i[i] - 1
            continue
        else:
            continue

    elif i > 0 and kazu - i != 1:
        if l_si_i[i+1] - l_si_i[i] < -1:
            print('No')
            exit()
        elif l_si_i[i+1] - l_si_i[i] == -1:
            if l_si_i[i] - l_si_i[i-1] >= 0:
                l_si_i[i] = l_si_i[i] - 1
            else:
                print('No')
                exit()
        else:
            continue
    elif kazu - i == 1:
        if l_si_i[i] - l_si_i[i-1] >= 0:
            l_si_i[i] = l_si_i[i] - 1
        else:
            print('No')
            exit()
print('Yes')


Fixed submission:
n = input()
l = list(map(int, input().split()))
m = 0
a = "Yes"
for i in l:
    if i < m-1:
        a = "No"
        break
    m = max(m, i)
print(a)

Buggy python submission (verdict: Runtime Error):
kazu = int(input())
suji = input().split()

l_si_i = [int(s) for s in suji]

if kazu == 1:
    print('Yes')
    exit()

for i in range(kazu):
    if kazu - i == 1:
        print('Yes')
    if i == 0:
        if l_si_i[i+1] - l_si_i[i] < -1:
            print('No')
            exit()
        else:
            continue
    else:
        if l_si_i[i+1] - l_si_i[i] == 0:
            continue
        elif l_si_i[i+1] - l_si_i[i] == 1:
            l_si_i[i+1] = l_si_i[i+1] - 1
            continue
        elif l_si_i[i+1] - l_si_i[i] == -1:
            if l_si_i[i] - l_si_i[i-1] <= 0:
                print('No')
                exit()
            else:
                continue
        elif l_si_i[i+1] - l_si_i[i] < -1:
            print('No')
            exit()
        else:
            continue


Fixed submission:
n = input()
l = list(map(int, input().split()))
m = 0
a = "Yes"
for i in l:
    if i < m-1:
        a = "No"
        break
    m = max(m, i)
print(a)
Buggy python submission (verdict: Runtime Error):
i = int(input())
l = list(map(int, input().split()))
s = sorted(l)
f = 0

for n in range(i):
    if l[n] == n+1:
        continue
    else:
        f = f + 1
        continue
print(f)
if f == 2:
    print('YES')
elif f == 0:
    print('YES')
else:
    print('NO')

Fixed submission:
a = list(map(int, input().split()))
b = a[0] + a[1]
if b%2 == 0:
  print(int(b/2))
else:
  print('IMPOSSIBLE')

Buggy python submission (verdict: Runtime Error):
a = input().split()
b = a[0] + a[1]
if b%2 == 0:
  print(b/2)
else:
  print('IMPOSSIBLE')

Fixed submission:
a = list(map(int, input().split()))
b = a[0] + a[1]
if b%2 == 0:
  print(int(b/2))
else:
  print('IMPOSSIBLE')
Buggy python submission (verdict: Runtime Error):
char_list = list(str)
for i in range(4):
    
    if i == 3:
        print('Good')
        break
    
    if char_list[i] == char_list[i+1] and i < 3:
        print('Bad')
        break

Fixed submission:
char_list = list(input())
for i in range(4):
    
    if i == 3:
        print('Good')
        break
    
    if char_list[i] == char_list[i+1] and i < 3:
        print('Bad')
        break
Buggy python submission (verdict: Runtime Error):
n =  int(input())
n_s = [*str(n)]
n_l = [int(s) for s in n_s]
c = 0
for i in n_l:
    c = i + c

if n % c == 0:
    print('Yes')
else:
    print('No')



Fixed submission:
n = int(input())
n_s = []
for c in str(n):
    n_s.append(c)
n_l = [int(s) for s in n_s]
c = 0
for i in n_l:
    c = i + c

if n % c == 0:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=map(int,input().split())
count=0
for i in range (a):
	if b[i]%2==0:
		if b[i]%3==0 or b[i]%5==0:
			count=1
		else:count=0
	else:count=1
if count=1:
	print("APPROVED")
else: print("DENIED")

Fixed submission:
a=int(input())
b=list(map(int,input().split()))
count=0
for i in range (a):
 if b[i]%2==0 and b[i]%3!=0 and b[i]%5!=0:
  count=0
  break
 else:count=1
if count==1:
 print("APPROVED")
else: print("DENIED")
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=list(input().split())
c=sorted(b)
for i in range (a):
	if c[i]==c[i+1]:
		print("No")
		break
	else:print("Yes")
	

Fixed submission:
a=int(input())
b=list(input().split())
c=sorted(b)
count=0
for i in range (a-1):
	if c[i]==c[i+1]:
		count=1
		break
	
if count==1:
	print("NO")	
else:print("YES")
Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
C=list(input().split())
count= 0
for i in range (B):
	count=count+int(C[i])
if count>=A:
	print("Yes")
else: print("No")

Fixed submission:
import math
a, b = map(int, input().split()) 
print(math.ceil(a/b))

Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
C=list(input())
count= 0
for i in range (B):
	count=count+int(C[i])
if count>=A:
	print("Yes")
else: print("No")

Fixed submission:
import math
a, b = map(int, input().split()) 
print(math.ceil(a/b))

Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
C=list(input())
count= 0
for i in range (B):
	count=count+int(C[i])
if count<=A:
	print("Yes")
else: print("No")

Fixed submission:
import math
a, b = map(int, input().split()) 
print(math.ceil(a/b))
Buggy python submission (verdict: Runtime Error):
A,B=map(int, input().split())
C=list(int(input()))
count= 0
for i in range (B):
	count=count+C[i]
if count<=A:
	print("Yes")
else: print("No")

Fixed submission:
A,B=map(int,input().split())
C=list(input().split())
count= 0
for i in range (B):
	count=count+int(C[i])
if count>=A:
	print("Yes")
else: print("No")
Buggy python submission (verdict: Runtime Error):
n,k=map(int, input().split())
h=list(map(int,input().split()))
H=sorted(h,reverse=True)
if n>=k:
	for i in range(k):
		H[i]=0
print(sum(H))
else: 
	print(0)

Fixed submission:
n,k=map(int, input().split())
h=list(map(int,input().split()))
H=sorted(h,reverse=True)
if n>=k:
 for i in range(k):
  H[i]=0
 print(sum(H))
else: 
 print(0)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = a*500
if c>=b:
  print("Yes")
else:
  print("No")

Fixed submission:
a,b = map(int,input().split())
c = a*500
if c>=b:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
a = int(input()) * 500
b = int(input())
if a>=b:
  print("Yes")
else:
  print("No")


Fixed submission:
a,b = map(int,input().split())
c = a*500
if c>=b:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
if k<=a:
	A=a-k
	B=b
elif k>=a and k<=b:
	A=0
	B=b+a-k
else:A=B=0
print(A,B)


Fixed submission:
S,T =input().split()
print(T+S)

Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
if k<=a:
	print(a-k,b)
elif k>=a and k<=b:
	print(a-a,b+a-k)
else: print(0 0)


Fixed submission:
S,T =input().split()
print(T+S)

Buggy python submission (verdict: Runtime Error):
S,T=.input().split()
print(TS)

Fixed submission:
S,T =input().split()
print(T+S)

Buggy python submission (verdict: Runtime Error):
S,T =.input().split()
print("T"+"S")

Fixed submission:
S,T =input().split()
print(T+S)

Buggy python submission (verdict: Runtime Error):
S,T = .input().split()
print("T+S")

Fixed submission:
S,T =input().split()
print(T+S)

Buggy python submission (verdict: Runtime Error):
S,T = .input().split()
print(T+S)


Fixed submission:
S,T =input().split()
print(T+S)
Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
if k<=a:
	print(a-k,b)
elif k>=a and k<=b:
	print(a-a,b+a-k)
else: print(0 0)

Fixed submission:
a,b,k=map(int,input().split())
if k<=a:
	A=a-k
	B=b
elif k>=a and k-a<=b:
	A=0
	B=b+a-k
else:A=B=0
print(A,B)

Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
for i in range (k):
	if a>0:
		a-=1
    break
	elif b>0:
		b-=1
print(a,b)

Fixed submission:
a,b,k=map(int,input().split())
if k<=a:
	A=a-k
	B=b
elif k>=a and k-a<=b:
	A=0
	B=b+a-k
else:A=B=0
print(A,B)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,k=map(int,input().split())
for i in range (k):
	if a>0:
		a-=1
	elif b>0:
		b-=1
print(a,b)

Fixed submission:
a,b,k=map(int,input().split())
if k<=a:
	A=a-k
	B=b
elif k>=a and k-a<=b:
	A=0
	B=b+a-k
else:A=B=0
print(A,B)
Buggy python submission (verdict: Runtime Error):
A=map(int,input())
B=map(int,input())
C=6-A-B
print(C)

Fixed submission:
A=int(input())
B=int(input())  
C=6-A-B
print(C)

Buggy python submission (verdict: Runtime Error):
A=int(input())
B=int(input())
if (A=1 and B=2)or(A=2 and B=1):
  print(3)
if (A=2 and B=3)or(A=3 and B=2):
  print(1)
else:
  print(2)

Fixed submission:
A=int(input())
B=int(input())  
C=6-A-B
print(C)

Buggy python submission (verdict: Runtime Error):
A=map(int,input())
B=map(int,input())
if (A=1 and B=2)or(A=2 and B=1):
  print(3)
if (A=2 and B=3)or(A=3 and B=2):
  print(1)
else:
  print(2)

Fixed submission:
A=int(input())
B=int(input())  
C=6-A-B
print(C)

Buggy python submission (verdict: Runtime Error):
A=map(int,input())
B=map(int,input())
if (A=1 and B=2)or(A=2 and B=1):
  print(3)
if (A=2 and B=3)or(A=3 and B=2):
  print(1)
if (A=3 and B=1)or(A=1 and B=3):
  print(2)

Fixed submission:
A=int(input())
B=int(input())  
C=6-A-B
print(C)

Buggy python submission (verdict: Runtime Error):
A=input()
B=input()
if A=1 and B=2:
  print(3)
if A=2 and B=3:
  print(1)
if A=3 and B=1:
  print(2)
if A=2 and B=1:
  print(3)
if A=3 and B=2:
  print(1)
if A=1 and B=3:
  print(2)

Fixed submission:
A=int(input())
B=int(input())  
C=6-A-B
print(C)

Buggy python submission (verdict: Runtime Error):
A=input()
B=input()
if (A=1 and B=2)or(A=2 and B=1):
  print(3)
if (A=2 and B=3)or(A=3 and B=2):
  print(1)
if (A=3 and B=1)or(A=1 and B=3):
  print(2)


Fixed submission:
A=int(input())
B=int(input())  
C=6-A-B
print(C)
Buggy python submission (verdict: Runtime Error):
a=input()
n=len(a)
count=0
for i in range(n):
	 if a[i]!=a[n+1-i]:
	 	a[i]=a[n+1-i]
	 	count+=1
print(count)

Fixed submission:
a=list(input())
n=len(a)
count=0
for i in range(n):
	 if a[i]!=a[n-1-i]:
	 	a[i]=a[n-1-i]
	 	count+=1
print(count)

Buggy python submission (verdict: Runtime Error):
a=input()
n=len(a)
count=0
for i in range (n)
	 if a[i]!=a[n+1-i]:
	 	a[i]=a[n+1-i]
	 	count+=1
print(count)

Fixed submission:
a=list(input())
n=len(a)
count=0
for i in range(n):
	 if a[i]!=a[n-1-i]:
	 	a[i]=a[n-1-i]
	 	count+=1
print(count)

Buggy python submission (verdict: Runtime Error):
a=input()
n=len(a)
count=0
for i in range (n)
	 if a[i]!=a[n+1-i]:
	 	a[i]=a[n+1-i]
	 	count+=1
        

Fixed submission:
a=list(input())
n=len(a)
count=0
for i in range(n):
	 if a[i]!=a[n-1-i]:
	 	a[i]=a[n-1-i]
	 	count+=1
print(count)
Buggy python submission (verdict: Runtime Error):
A=input()
print(A*A)

Fixed submission:
A=int(input())
print(A*A)
Buggy python submission (verdict: Runtime Error):
a=int(input())
inport math
b=a/2
c=math.ceil(b)
print(c/a)

Fixed submission:
import math
a=int(input())
b=math.ceil(a/2)
print(b/a)

Buggy python submission (verdict: Runtime Error):
a=int(input())
inport math
b=math.ceil(a/2)
print(b/a)

Fixed submission:
import math
a=int(input())
b=math.ceil(a/2)
print(b/a)

Buggy python submission (verdict: Runtime Error):
a=int(input())
inport math
b=math.ceil(a/2)
print(a/b)

Fixed submission:
import math
a=int(input())
b=math.ceil(a/2)
print(b/a)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
  	 if int(height[i])>=b:
      	count+=1
print(count)

Fixed submission:
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
    if int(height[i])>=b:
       count+=1
print(count)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
  	 if int(height[i])>=b:
      	count+=1
print(str(count))

Fixed submission:
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
    if int(height[i])>=b:
       count+=1
print(count)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
  	 if int(height[i])>=b:
      	count+=count
print(str(count))

Fixed submission:
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
    if int(height[i])>=b:
       count+=1
print(count)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
height=list(input())
count=0
for i in range (a):
  	 if height[i]>=b:
      	count+=count
print(str(count))

Fixed submission:
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
    if int(height[i])>=b:
       count+=1
print(count)