Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())

if k == 0:
  print(n**2)
  exit()


ans = 0
for b in range(1, n+1):
  ans += int(N/b) * max(0, b-k)
  ans += max(0, n%b+(1-k))
  
print(ans)


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

if k == 0:
  print(n**2)
  exit()


ans = 0
for b in range(1, n+1):
  ans += n//b * max(0, b-k)
  ans += max(0, n%b+(1-k))
  
print(ans)

Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())

if k == 0:
  print(n**2)
  exit()


ans = 0
for b in range(1, n+1):
  ans += (N//b) * max(0, b-k)
  ans += max(0, n%b+(1-k))
  
print(ans)


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

if k == 0:
  print(n**2)
  exit()


ans = 0
for b in range(1, n+1):
  ans += n//b * max(0, b-k)
  ans += max(0, n%b+(1-k))
  
print(ans)

Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())

if k == 0:
  print(n**2)
  exit()


ans = 0
for b in range(1, n+1):
  ans += N//b * max(0, b-k)
  ans += max(0, n%b+(1-k))
  
print(ans)

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

if k == 0:
  print(n**2)
  exit()


ans = 0
for b in range(1, n+1):
  ans += n//b * max(0, b-k)
  ans += max(0, n%b+(1-k))
  
print(ans)

Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())

if k == 0:
  print(n**2)


ans = 0
for b in range(1, n+1):
  ans += N//b * max(0, b-k)
  ans += max(0, n%b+(1-k))
  
print(ans)

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

if k == 0:
  print(n**2)
  exit()


ans = 0
for b in range(1, n+1):
  ans += n//b * max(0, b-k)
  ans += max(0, n%b+(1-k))
  
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b,c,d = input()
print("Yes" if a=b=c or b=c=d else "No")

Fixed submission:
n = input()
print("Yes" if n[0]==n[1]==n[2] or n[1]==n[2]==n[3] else "No")

Buggy python submission (verdict: Runtime Error):
N = input()
print("Yes" if n[0]==n[1]==n[2] or n[1]==n[2]==n[3] else "No")


Fixed submission:
n = input()
print("Yes" if n[0]==n[1]==n[2] or n[1]==n[2]==n[3] else "No")

Buggy python submission (verdict: Runtime Error):
N = input()
print("Yes" if n[0]==n[1]==n[2] or n[1]==n[2]==n[3])

Fixed submission:
n = input()
print("Yes" if n[0]==n[1]==n[2] or n[1]==n[2]==n[3] else "No")
Buggy python submission (verdict: Runtime Error):
N = int(input())

l = [1, 2]

for i in range(N-1):
  l = l.append(l[i]+l[i+1])
  
print(l[-1])

Fixed submission:
N = int(input())

l = [2, 1]

for i in range(N-1):
  l.append(l[i]+l[i+1])
  
print(l[-1])
Buggy python submission (verdict: Runtime Error):
N = int(input())
a=[list(map(int,input().split())) for i in range(N)]
count = 0

for i in range(N+1):
  count += a[i][1] - a[i][0] + 1
  
print(count)
  


Fixed submission:
N = int(input())
a=[list(map(int,input().split())) for i in range(N)]
count = 0

for i in range(N):
  count += a[i][1] - a[i][0] + 1
  
print(count)

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

count = 0

for i in range(N+1):
  l, r = map(int, input().split())
  count += r-l+1
  
print(count)
  

Fixed submission:
N = int(input())
a=[list(map(int,input().split())) for i in range(N)]
count = 0

for i in range(N):
  count += a[i][1] - a[i][0] + 1
  
print(count)

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

count = 0

for i in range(N+1):
  l, r = map(int, input().split())
  count += l-r+1
  
print(count)
  

Fixed submission:
N = int(input())
a=[list(map(int,input().split())) for i in range(N)]
count = 0

for i in range(N):
  count += a[i][1] - a[i][0] + 1
  
print(count)
Buggy python submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())

if a<=c<=b<=d:
  print(b-c)
elif b<=a<=d<=c:
  print(d-a)
elif a<=c<=d<=b:
  print(d-c)
elif c<=a<=b<=d:
  print(b-a)
elif b=c or a=d:
  print(1)
else:
  print(0)

Fixed submission:
a, b, c, d = map(int, input().split())

t = min(b, d) - max(a, c)

print(max(0, t))
Buggy python submission (verdict: Runtime Error):
o = list(input())
e = list(input()+[""])

for x, y in zip(o, e):
  print(x+y, end="")

Fixed submission:
o = list(input())
e = list(input())+[""]

for x, y in zip(o,e):
  print(x+y,end="")
Buggy python submission (verdict: Runtime Error):
a, b = map(str, input().split())

if a==str(H):
  print(b)
elif a==str(D):
  if b==str(H):
    print(D)
  elif b==str(D):
    print(H)

Fixed submission:
a, b = map(str, input().split())

print('H' if a == b else 'D')

Buggy python submission (verdict: Runtime Error):
a, b = map(str, input().split())

if a==H:
  print(b)
elif a==D:
  if b==H:
    print(D)
  elif b==D:
    print(H)

Fixed submission:
a, b = map(str, input().split())

print('H' if a == b else 'D')

Buggy python submission (verdict: Runtime Error):
a, b = input().split()

if a==H:
  print(b)
elif a==D:
  if b==H:
    print(D)
  elif b==D:
    print(H)

Fixed submission:
a, b = map(str, input().split())

print('H' if a == b else 'D')
Buggy python submission (verdict: Runtime Error):
k,s = map(int, input().split())

count = 0

for x in range(k+1):
  for y in range(k+1):
    z = S - (x + y)
    
    if 0 <= z <= k:
      count += 1
      
print(count)

Fixed submission:
k,s = map(int, input().split())

count = 0

for x in range(k+1):
  for y in range(k+1):
    z = s - (x + y)
    
    if 0 <= z <= k:
      count += 1
      
print(count)

Buggy python submission (verdict: Runtime Error):
k,s = map(int, input().split())

count = 0

for x in range(k+1):
  for i in range(k+1):
    z = S - (x + y)
    
    if 0 <= z <= k:
      count += 1
      
print(count)

Fixed submission:
k,s = map(int, input().split())

count = 0

for x in range(k+1):
  for y in range(k+1):
    z = s - (x + y)
    
    if 0 <= z <= k:
      count += 1
      
print(count)
Buggy python submission (verdict: Runtime Error):
l = list(map(int, input().split()))
lr = list(map(lambda x: x%10, l))
lr = [e for e in lr if e != 0]
lr = lr.sorted
print(sum(l) + sum(list(map(lambda x: 10-x, lr[1:]))))

Fixed submission:
time=[]
back=0
for i in range(5):
    A=int(input())
    if A%10==0:
        pass
    else:
        back=max(back,10-A%10)
        A=(A//10)*10 +10

    time.append(A)

print(sum(time)-back)
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
print("%d"% max([A + B, A - B, A* B])


Fixed submission:
A, B = map(int, input().split())
val = A * B
if B > 0:
  val = (A + B) if (A + B) > val else val
else:
  val = (A - B) if (A - B) > val else val

print("%d"%val)
Buggy python submission (verdict: Time Limit Exceeded):
A, B, K = [int(i) for i in input().split()]

for i in range(0,K):
  if A >= 1:
    A = A - 1
  elif B >= 1:
    B = B - 1

print(A, B)

Fixed submission:
A, B, K = [int(i) for i in input().split()]

jdg = K - A
A = A - min(A, K)
B = B - max(0, jdg)
B = max(0, B)
print(A, B)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()

if N%2 == 0:
    jdg_1 = S[0:N/2]
    jdg_2 = S[N/2:N]
    if jdg_1==jdg_2:
      out = 'Yes'
    else:
      out = 'No'
else:
  out = 'No'

print(out)

Fixed submission:
N = int(input())
S = input()

if N%2 == 0:
    jdg_1 = S[0:int(N/2)]
    jdg_2 = S[int(N/2):int(N)]
    if jdg_1==jdg_2:
      out = 'Yes'
    else:
      out = 'No'
else:
  out = 'No'

print(out)
Buggy python submission (verdict: Time Limit Exceeded):
import itertools


input()
nums = [int(i) for i in input().split(" ")]
longest = len(bin(max(nums))) - 2
nums_bin = [format(i, "b").zfill(longest) for i in nums]


result = 0
for i in range(1, longest+1):
    one = 0
    zero = 0
    for num_bin in nums_bin:
        if num_bin[-1*i] == "1":
            one += 1
        elif num_bin[-1*i] == "0":
            zero += 1
        else:
            raise Exception()
    result += (2 ** (i-1)) * (one * zero)
print(result % (10 ** 9 + 7))

Fixed submission:
import itertools


N = int(input())
nums = [int(i) for i in input().split(" ")]
longest = len(bin(max(nums))) - 2
nums_bin = [format(i, "b").zfill(longest) for i in nums]


result = 0
for index, numbers in enumerate(zip(*nums_bin)):
    i = longest - index - 1
    zero = numbers.count("0")
    one = N - zero
    result += (2 ** i) * (zero * one)
print(result % (10 ** 9 + 7))

Buggy python submission (verdict: Time Limit Exceeded):
from itertools import combinations


trash = input()
nums = [int(i) for i in input().split(" ")]

s = 0
for pair in combinations(nums, 2):
    s += pair[0] ^ pair[1]
print(s % (10**9+7))

Fixed submission:
import itertools


N = int(input())
nums = [int(i) for i in input().split(" ")]
longest = len(bin(max(nums))) - 2
nums_bin = [format(i, "b").zfill(longest) for i in nums]


result = 0
for index, numbers in enumerate(zip(*nums_bin)):
    i = longest - index - 1
    zero = numbers.count("0")
    one = N - zero
    result += (2 ** i) * (zero * one)
print(result % (10 ** 9 + 7))
Buggy python submission (verdict: Runtime Error):
X, Y = map(int, input().split(" "))


def num_combinations_mod(n, r, mod, num_max=10**6):
    # if this functions is called twice or more, init process should be placed before calling this function to
    # save time.
    f_mod, f_mod_inv = num_combinations_mod_init(num_max, mod)
    return f_mod[n] * (f_mod_inv[r] * f_mod_inv[n-r] % mod) % mod


def num_combinations_mod_init(num_max, mod):
    factorials_mod = dict()
    factorials_mod_inv = dict()
    factorials_mod[0] = 1
    factorials_mod[1] = 1
    factorials_mod_inv[0] = 1
    factorials_mod_inv[1] = 1
    mod_inv = dict()
    mod_inv[1] = 1
    for i in range(2, num_max):
        factorials_mod[i] = factorials_mod[i - 1] * i % mod
        mod_inv[i] = mod - mod_inv[mod % i] * (mod // i) % mod
        factorials_mod_inv[i] = factorials_mod_inv[i - 1] * mod_inv[i] % mod
    return factorials_mod, factorials_mod_inv


def get(num1, num2):
    if num1 > num2:
        num = num2
    else:
        num = num1
    return num_combinations_mod(num1+num2, num, 10**9+7)


answer = 0
if (X + Y) % 3 != 0:
    print(0)
    exit()

total = (X + Y) // 3
n_moveB = (2 * X - Y) // 3
n_moveA = total - n_moveB
answer = get(n_moveA, n_moveB)

print(answer)





Fixed submission:

def num_combinations_mod(n, r, mod, num_max=10**6):
    # if this functions is called twice or more, init process should be placed before calling this function to
    # save time.
    if r > n:
        return 0
    elif r == n:
        return 1
    elif r < 0 or n < 0:
        return 0
    f_mod, f_mod_inv = num_combinations_mod_init(num_max, mod)
    return f_mod[n] * (f_mod_inv[r] * f_mod_inv[n-r] % mod) % mod


def num_combinations_mod_init(num_max, mod):
    factorials_mod = dict()
    factorials_mod_inv = dict()
    factorials_mod[0] = 1
    factorials_mod[1] = 1
    factorials_mod_inv[0] = 1
    factorials_mod_inv[1] = 1
    mod_inv = dict()
    mod_inv[1] = 1
    for i in range(2, num_max):
        factorials_mod[i] = factorials_mod[i - 1] * i % mod
        mod_inv[i] = mod - mod_inv[mod % i] * (mod // i) % mod
        factorials_mod_inv[i] = factorials_mod_inv[i - 1] * mod_inv[i] % mod
    return factorials_mod, factorials_mod_inv


def get(num1, num2):
    if num1 > num2:
        num = num2
    else:
        num = num1
    return num_combinations_mod(num1+num2, num, 10**9+7)


def main(X, Y):
    if (X + Y) % 3 != 0:
        return 0

    total = (X + Y) // 3
    n_moveB = (2 * X - Y) // 3
    n_moveA = total - n_moveB
    answer = get(n_moveA, n_moveB)

    return answer


X, Y = map(int, input().split(" "))
print(main(X, Y))
Buggy python submission (verdict: Runtime Error):
N = int(input())
steps = list(map(int, input().split(" ")))

costs = [None] * N
costs[0] = 0
costs[1] = abs(steps[1] - steps[0])
costs[2] = min(abs(steps[2] - steps[0]), costs[1] + abs(steps[2] - steps[1]))

for i in range(3, N):
    cost1 = costs[i-1] + abs(steps[i-1] - steps[i])
    cost2 = costs[i-2] + abs(steps[i-2] - steps[i])
    costs[i] = min(cost1, cost2)

print(costs[N-1])

Fixed submission:
N = int(input())
steps = list(map(int, input().split(" ")))

costs = [None] * N
costs[0] = 0
costs[1] = abs(steps[1] - steps[0])
if N > 2:
    costs[2] = min(abs(steps[2] - steps[0]), costs[1] + abs(steps[2] - steps[1]))

for i in range(3, N):
    cost1 = costs[i-1] + abs(steps[i-1] - steps[i])
    cost2 = costs[i-2] + abs(steps[i-2] - steps[i])
    costs[i] = min(cost1, cost2)

print(costs[N-1])
Buggy python submission (verdict: Time Limit Exceeded):
import math


def get_min(num_step):
    res = float("inf")
    for i in range(1, min(num_step, K)+1):
        cost = costs[num_step-i] + abs(steps[num_step] - steps[num_step-i])
        if cost < res:
            res = cost
    return res


N, K = map(int, input().split(" "))
steps = list(map(int, input().split(" ")))
costs = [None] * N
costs[0] = 0

for i in range(1, N):
    costs[i] = get_min(i)

print(costs[N-1])


Fixed submission:
import math


def get_min(num_step):
    res = float("inf")
    for i in range(1, min(num_step, K)+1):
        cost = costs[num_step-i] + abs(steps[num_step] - steps[num_step-i])
        if cost < res:
            res = cost
    return res


N, K = map(int, input().split(" "))
steps = list(map(int, input().split(" ")))
costs = [None] * N
costs[0] = 0

for i in range(1, N):
    costs[i] = get_min(i)

print(costs[N-1])

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


def get_min(num_step):
    res = math.inf
    for i in range(1, min(num_step, K)+1):
        cost = costs[num_step-i] + abs(steps[num_step] - steps[num_step-i])
        if cost < res:
            res = cost
    return res


N, K = map(int, input().split(" "))
steps = list(map(int, input().split(" ")))
costs = [None] * N
costs[0] = 0

for i in range(1, N):
    costs[i] = get_min(i)

print(costs[N-1])


Fixed submission:
import math


def get_min(num_step):
    res = float("inf")
    for i in range(1, min(num_step, K)+1):
        cost = costs[num_step-i] + abs(steps[num_step] - steps[num_step-i])
        if cost < res:
            res = cost
    return res


N, K = map(int, input().split(" "))
steps = list(map(int, input().split(" ")))
costs = [None] * N
costs[0] = 0

for i in range(1, N):
    costs[i] = get_min(i)

print(costs[N-1])
Buggy python submission (verdict: Time Limit Exceeded):
# -*- Coding: utf-8 -*-

x = int(input())
min_sosu = x
flg_found = False

for i in range(x, 1000000):
    for j in range(2, 100000):
        if i%j == 0 and j < x:
            break
        if i%j == 0 and j >= x and i == j:
            min_sosu = i
            flg_found = True
            print(min_sosu)
            break
    if flg_found:
        break


Fixed submission:
# -*- Coding: utf-8 -*-

x = int(input())
min_sosu = x
flg_found = False

for i in range(x, 1000000):
    for j in range(2, i*i):
        if i%j == 0 and j < x:
            break
        if i%j == 0 and j >= x and i == j:
            min_sosu = i
            flg_found = True
            print(min_sosu)
            break
    if flg_found:
        break

Buggy python submission (verdict: Runtime Error):
# -*- Coding: utf-8 -*-

x = int(input())
min_sosu = x


for i in range(x, 100000):
    for j in range(2, 100000):
        if i%j == 0 and j < x:
            break
        if i%j == 0 and j >= x and i == j:
            min_sosu = i
            print(min_sosu)
            exit(1)

if min_sosu == x:
    print(min_sosu)


Fixed submission:
# -*- Coding: utf-8 -*-

x = int(input())
min_sosu = x
flg_found = False

for i in range(x, 1000000):
    for j in range(2, i*i):
        if i%j == 0 and j < x:
            break
        if i%j == 0 and j >= x and i == j:
            min_sosu = i
            flg_found = True
            print(min_sosu)
            break
    if flg_found:
        break
Buggy python submission (verdict: Runtime Error):
a=int(input())
s=str(input())
if a=>3200:
    print(s)
elif a<3200:
    print("red")

Fixed submission:
a=int(input())
s=input()
if a >= 3200:
    print(s)
elif a<3200:
    print("red")

Buggy python submission (verdict: Runtime Error):
a=int(input())
s=str(input())
if a=>3200:
    print(s)
elif a<3200:
    print("red")

Fixed submission:
a=int(input())
s=input()
if a >= 3200:
    print(s)
elif a<3200:
    print("red")
Buggy python submission (verdict: Time Limit Exceeded):
in_li = list(map(int,input().split()))
A = in_li[0]
B = in_li[1]
K = in_li[2]
if A + B == K :
    print("0 0")
elif A > K :
    print(A-K,"",B)
else :
    for i in range(K) :
        if A != 0 :
            A -= 1
        elif B != 0 :
            B -= 1
        else :
            pass
    print(A,"",B)


Fixed submission:
in_li = list(map(int,input().split()))
A = in_li[0]
B = in_li[1]
K = in_li[2]
if A + B <= K :
    print("0 0")
else :
    if A > K :
        print(A-K,"",B)
    elif B > K - A :
        print("0",B-(K-A))

Buggy python submission (verdict: Time Limit Exceeded):
in_li = list(map(int,input().split()))
A = in_li[0]
B = in_li[1]
K = in_li[2]
if A + B == K :
    print("0 0")
else :
    for i in range(K) :
        if A != 0 :
            A -= 1
        elif B != 0 :
            B -= 1
        else :
            pass
    print(A,"",B)


Fixed submission:
in_li = list(map(int,input().split()))
A = in_li[0]
B = in_li[1]
K = in_li[2]
if A + B <= K :
    print("0 0")
else :
    if A > K :
        print(A-K,"",B)
    elif B > K - A :
        print("0",B-(K-A))
Buggy python submission (verdict: Runtime Error):
N = int(input())

for i in range(1, 10):
  for k in range(1,10):
    if N == i * k:
      print("Yes")
      sys.exit()
print("No")


Fixed submission:
import sys
N = int(input())

for i in range(1, 10):
  for k in range(1,10):
    if N == i * k:
      print("Yes")
      sys.exit()

print("No")

Buggy python submission (verdict: Runtime Error):
for i in range(1, 10):
  for k in range(1,10):
    if N == i * k:
      print("Yes")
      sys.exit()
print("No")

Fixed submission:
import sys
N = int(input())

for i in range(1, 10):
  for k in range(1,10):
    if N == i * k:
      print("Yes")
      sys.exit()

print("No")
Buggy python submission (verdict: Runtime Error):
num = int(input())
each_num = list(map(int, input().split(" ")))

ans = []

i = 1
for k in range(1, num+1):
    ans.append(each_num.index(k) + 1)
print(*ans)



Fixed submission:
a = int(input())

i = 1
odds = 0
while i <= a:
    if i % 2 == 1:
        odds = odds + 1
        i = i +1
    else:
        i = i + 1

print(odds/a)
Buggy python submission (verdict: Runtime Error):
n = int(input())
l = list(map(int, input().split(" ")))
a =[0]*num

for i in range(n):
    #print(i)
    a[l[i]-1] = i + 1 #each_numのi番目のインデックスに代入, -1 はi 番目が1,2,3 ...

for i in range(n):
    print(a[i], end = " ")

Fixed submission:
n = int(input())
l = list(map(int, input().split(" ")))
a =[0]*n

for i in range(n):
    #print(i)
    a[l[i]-1] = i + 1 #each_numのi番目のインデックスに代入, -1 はi 番目が1,2,3 ...

for i in range(n):
    print(a[i], end = " ")

Buggy python submission (verdict: Time Limit Exceeded):
num = int(input())
each_num = list(map(int, input().split(" ")))

ans = []

i = 1
for k in range(1, num+1):
    ans.append(each_num.index(k) + 1)
for i in range(num):
    print(ans[i], end = " ")



Fixed submission:
n = int(input())
l = list(map(int, input().split(" ")))
a =[0]*n

for i in range(n):
    #print(i)
    a[l[i]-1] = i + 1 #each_numのi番目のインデックスに代入, -1 はi 番目が1,2,3 ...

for i in range(n):
    print(a[i], end = " ")

Buggy python submission (verdict: Runtime Error):
import numpy as np
num = int(input())
each_num = list(map(int, input().split(" ")))

i = 1
ans = [[]]
while i >= num:
    ans.append = each_num.index(i)

print(ans)

Fixed submission:
n = int(input())
l = list(map(int, input().split(" ")))
a =[0]*n

for i in range(n):
    #print(i)
    a[l[i]-1] = i + 1 #each_numのi番目のインデックスに代入, -1 はi 番目が1,2,3 ...

for i in range(n):
    print(a[i], end = " ")
Buggy python submission (verdict: Runtime Error):
today = input()

weather = ["Sunny", "Cloudy", "Rainy"]

days = weather.index(today)
tomorrow = days + 1
print(weather[tomorrow])

Fixed submission:
today = input()

weather = ["Sunny", "Cloudy", "Rainy"]

days = weather.index(today)
tomorrow = days + 1
if tomorrow == 3:
    tomorrow = 0
    
print(weather[tomorrow])
Buggy python submission (verdict: Runtime Error):
a = int(input())
s = int(input())

if a >= 3200:
    print(s)
else:
    print("red")
        

Fixed submission:
a = int(input())
s = str(input())

if a >= 3200:
    print(s)
else:
    print("red")

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

if a >= 3200:
    print(s)
else:
    print("red")

Fixed submission:
a = int(input())
s = str(input())

if a >= 3200:
    print(s)
else:
    print("red")

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

if a <= 3200:
    print(s)
else:
    print("red")
        

Fixed submission:
a = int(input())
s = str(input())

if a >= 3200:
    print(s)
else:
    print("red")

Buggy python submission (verdict: Runtime Error):
if a <= 3200:
    print(s)
else:
    print("red")

Fixed submission:
a = int(input())
s = str(input())

if a >= 3200:
    print(s)
else:
    print("red")
Buggy python submission (verdict: Time Limit Exceeded):
x = int(input())
if x >= 2000:
    print(1)
else:
    for i in range(0,21):
        for j in range(0,21):
            for k in range(0,21):
                for l in range(0,21):
                    for m in range(0,21):
                        for n in range(0,21):
                            if 100*i + 101*j + 102*k + 103*l + 104*m + 105*n == x:
                                print(1)
                                exit(0)
                            else:
                                pass
    print(0) 

Fixed submission:
x = int(input())
if x >= 2000:
    print(1)
    exit(0)
else:
    for i in range(0,21):
        if 105*i + 1 <= x <= 99 + i*100:
            print(0)
            exit(0)
        else:
            pass
    print(1)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if 1<= a <= 9 and 1<= b <= 9:
    print(a*b)
else:
    print(-1

Fixed submission:
a, b = map(int, input().split())
if 1<= a <= 9 and 1<= b <= 9:
    print(a*b)
else:
    print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
for i in range(n):
    s = a[i]
    del a[i]
    b = sorted(a)
    print(b[int(n/2-1)])
    a.insert(i, s)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
b = sorted(a)
for i in range(n):
    if a[i] < b[int(n/2)]:
        print(b[int(n/2)])
    else:
        print(b[int(n/2 -1)])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = list(map(int,input().split()))
sum = 0
s.insert(0, 0)
s.insert(n+1, 0)
for i in range(1,n+1):
    st = s[i]
    s.pop(i)
    for j in range(n):
        sum += abs((s[j])-(s[j+1]))
    print(sum)
    s.insert(i, st)
    sum = 0

Fixed submission:
n = int(input())
s = list(map(int,input().split()))
sum = 0
s.insert(0, 0)
s.insert(n+1, 0)
for i in range(n+1):
    sum += abs((s[i])-(s[i+1]))
for j in range(1,n+1):
    print(sum - abs(s[j-1]-s[j]) - abs(s[j]-s[j+1]) +abs(s[j-1]-s[j+1]))
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [input() for i in range(n+1)]
m = int(input())
b = [input() for i in range(m+1)]
min = 0
for i in range(n+1):
    max = a.count(a[i])-b.count(a[i])
    if max >= min:
        min = max
    else:
        pass
print(max)
        

Fixed submission:
n = int(input())
a = [input() for i in range(n)]
m = int(input())
b = [input() for i in range(m)]
min = 0
for i in range(n):
    max = a.count(a[i])-b.count(a[i])
    if max >= min:
        min = max
    else:
        pass
print(min)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [input() for i in range(n)]
m = int(input())
b = [input() for i in range(m)]
min = 0
for i in range(n+1):
    max = a.count(a[i])-b.count(a[i])
    if max >= min:
        min = max
    else:
        pass
print(max)

Fixed submission:
n = int(input())
a = [input() for i in range(n)]
m = int(input())
b = [input() for i in range(m)]
min = 0
for i in range(n):
    max = a.count(a[i])-b.count(a[i])
    if max >= min:
        min = max
    else:
        pass
print(min)