Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
r,g,b=map(str,input().split())
l=('r'+'g'+'b')
if 0 == (int(l)%4):
  print('YES')
else:
  print('NO')


Fixed submission:
r,g,b=map(int,input().split())
l=(str(r)+str(g)+str(b))
if 0 == (int(l)%4):
  print('YES')
else:
  print('NO')

Buggy python submission (verdict: Runtime Error):
r,g,b=map(str,input().strip())=l
if 0 == (int(l)%4):
  print('YES')
else:
  print('NO')

Fixed submission:
r,g,b=map(int,input().split())
l=(str(r)+str(g)+str(b))
if 0 == (int(l)%4):
  print('YES')
else:
  print('NO')

Buggy python submission (verdict: Runtime Error):
l=(str(r)+str(g)+str(b))
if 0 == (int(l)%4):
  print('YES')
else:
  print('NO')

Fixed submission:
r,g,b=map(int,input().split())
l=(str(r)+str(g)+str(b))
if 0 == (int(l)%4):
  print('YES')
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
def main():
    word_len = int(input())
    word = str(input())
    R_list = []
    G_list = []
    B_list = []
    for i in range(word_len):
        if word[i] == "R":
            R_list.append(i)
        if word[i] == "G":
            G_list.append(i)
        if word[i] == "B":
            B_list.append(i)
    counter = 0
    for r in R_list:
        for g in G_list:
            for b in B_list:
                v =  [r,g,b]
                v.sort()
                if (v[1]-v[0]) != (v[2]-v[1]):
                    counter += 1
    print(counter)

if __name__ == '__main__':
    main()

Fixed submission:
a = input()
len_a =  len(a)
seven = 0
for i in range(len_a):
    if a[i] =="7":
        seven = 1
if  seven == 1:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import collections
a = int(input())
l = []
for i in range(a):
    l.append(input())
counted = collections.Counter(l)

# 最頻値を求める
m = max(counted.values())

# 頻出数の文字を集める
chars = [key for key, value in counted.items()
             if value == m]

for i in chars:
    print(i)

Fixed submission:
a,b,c = input().split()
d = 0
if a == b:
    if a != c:
        d +=1
if a == c:
    if b != c:
        d +=1
if c == b:
    if a != c:
        d +=1
if d>0:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import collections
a = int(input())
l = []
for i in range(a):
    l.append(input())
counted = collections.Counter(l)
 
m = max(counted.values())
 
chars = [key for key, value in counted.items()
             if value == m].sort()
chars.sort()

for i in chars:
    print(i)

Fixed submission:
import collections
a = int(input())
l = []
for i in range(a):
    l.append(input())
counted = collections.Counter(l)
 
m = max(counted.values())
 
chars = [key for key, value in counted.items()
             if value == m]
chars.sort()
 
for i in chars:
    print(i)

Buggy python submission (verdict: Runtime Error):
import pandas as pd
a = int(input())
b = []
for i in range(a):
    b.append(input())
b = pd.Series(b) 
c = b.mode().tolist()
c.sort()
for i in c:
    print(i)

Fixed submission:
import collections
a = int(input())
l = []
for i in range(a):
    l.append(input())
counted = collections.Counter(l)
 
m = max(counted.values())
 
chars = [key for key, value in counted.items()
             if value == m]
chars.sort()
 
for i in chars:
    print(i)

Buggy python submission (verdict: Time Limit Exceeded):
a = int(input())
b = []
for i in range(a):
    b.append(input())
c = list(set(b))
d = []
for i in c:
    d.append(b.count(i))
e = [i for i, x in enumerate(d) if x == max(d)]
f = []
for i in e:
    f.append(c[i])
f.sort()
for i in f:
    print(i)

Fixed submission:
import collections
a = int(input())
l = []
for i in range(a):
    l.append(input())
counted = collections.Counter(l)
 
m = max(counted.values())
 
chars = [key for key, value in counted.items()
             if value == m]
chars.sort()
 
for i in chars:
    print(i)
Buggy python submission (verdict: Runtime Error):
inp = input().split()
n,k = map(int, inp)
nums = list(input().split())
nums_list = list(map(int, nums))
kill_en_hp = 0
if len(nums_list) < k:
    print(0)
else:
    nums_list.sort()
    nums_list_2 = nums_list[k:]
    print(sum(nums_list_2u))

Fixed submission:
inp = input().split()
n,k = map(int, inp)
nums = list(input().split())
nums_list = list(map(int, nums))
kill_en_hp = 0
if len(nums_list) < k:
    print(0)
else:
    nums_list.sort(reverse=True)
    nums_list_2 = nums_list[k:]
    print(sum(nums_list_2))

Buggy python submission (verdict: Time Limit Exceeded):
inp = input().split()
n,k = map(int, inp)
nums = list(input().split())
nums_list = list(map(int, nums))
if len(nums_list) < k:
    print(0)
else:
    for i in range(k):
        nums_list.pop(nums_list.index(max(nums_list)))
    print(sum(nums_list))

Fixed submission:
inp = input().split()
n,k = map(int, inp)
nums = list(input().split())
nums_list = list(map(int, nums))
kill_en_hp = 0
if len(nums_list) < k:
    print(0)
else:
    nums_list.sort(reverse=True)
    nums_list_2 = nums_list[k:]
    print(sum(nums_list_2))
Buggy python submission (verdict: Runtime Error):
N = list(map(int,input(),split()))
A = N.sort()
print(A)

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

A = abs(N[0]-N[1])
B = abs(N[1]-N[2])

print(A+B)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
A.sort()
print(abs(A[0]-A[-1]))

Fixed submission:
x = int(input())

if x%2 == 0:
  print(x)
else:
  print(x*2)

Buggy python submission (verdict: Runtime Error):
a = [input() for i in range(2)]
b = a[1]
x = int(max(b))-int(min(b))
print(x)

Fixed submission:
x = int(input())

if x%2 == 0:
  print(x)
else:
  print(x*2)

Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
x = int(max(b))-int(min(b))
print(x)

Fixed submission:
x = int(input())

if x%2 == 0:
  print(x)
else:
  print(x*2)
Buggy python submission (verdict: Runtime Error):
a = [input() for i in range(2)]
b = a[1]
x = int(max(b))-int(min(b))
print(x)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
A.sort()
print(abs(A[0]-A[-1]))

Buggy python submission (verdict: Runtime Error):
a = input()
c, b = a.split("/n")
x = int(max(b))-int(min(b))
print(x)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
A.sort()
print(abs(A[0]-A[-1]))

Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
x = int(max(b))-int(min(b))
print(x)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
A.sort()
print(abs(A[0]-A[-1]))

Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
x = int(max(b))-int(min(b))
print(x)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
A.sort()
print(abs(A[0]-A[-1]))

Buggy python submission (verdict: Runtime Error):
a = input()
b = list(int(input()))
x = max(b)-max(b)
print(x)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
A.sort()
print(abs(A[0]-A[-1]))

Buggy python submission (verdict: Runtime Error):
a = input()
b = list(int(input()))
x = max(b)-max(a)
print(x)


Fixed submission:
N = int(input())
A = list(map(int,input().split()))
A.sort()
print(abs(A[0]-A[-1]))
Buggy python submission (verdict: Runtime Error):
a = input()
sn = list(str(a))

for i in sn:
    x = int(i)
    y = y + x

a = int(a)
if a%y == 0:
    print('Yes')
else:
    print('No')

Fixed submission:
x = input()
a = x.count('+')
b = x.count('-')
answer = a - b
print(answer)
Buggy python submission (verdict: Runtime Error):
a = input()
sn = list(str(a))

for i in sn:
    x = int(i)
    y = y + x

a = int(a)
if a%y == 0:
    print('Yes')
else:
    print('No')

Fixed submission:
a = input()
sn = list(str(a))
y=0
 
for i in sn:
    x = int(i)
    y = y +x

a = int(a)
if a%y == 0:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
input = input()
sn = list(str(input))
y = 0
for i in sn:
  x = int(i)
  y = y + x

if input%%y == 0:
  print('Yes')
else:
  print('No')


Fixed submission:
a = input()
sn = list(str(a))
y=0
 
for i in sn:
    x = int(i)
    y = y +x

a = int(a)
if a%y == 0:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
n, Y = map(int, input().split())
for x in range(n):
    for y in range(n-x):
        z = n-x-y
        if (x*10000 + y*5000 + z*1000) == Y:
            print(x, y, z)
            a = 1
            break
if a != 1:
    print(-1, -1, -1)

Fixed submission:
n, Y = map(int, input().split())
a = 0
for x in range(n+1):
    for y in range(n-x+1):
        z = n-x-y
        if (x*10000 + y*5000 + z*1000) == Y:
            print(x, y, z)
            a = 1
            break
    if a == 1:
        break
if a != 1:
    print(-1, -1, -1)

Buggy python submission (verdict: Runtime Error):
n, Y = map(int, input().split())
for x in range(n):
    for y in range(n-x):
        z = n-x-y
        if (x*10000 + y*5000 + z*1000) == Y:
            print(x, y, z)
            a = 1
            exit()
if a != 1:
    print(-1, -1, -1)

Fixed submission:
n, Y = map(int, input().split())
a = 0
for x in range(n+1):
    for y in range(n-x+1):
        z = n-x-y
        if (x*10000 + y*5000 + z*1000) == Y:
            print(x, y, z)
            a = 1
            break
    if a == 1:
        break
if a != 1:
    print(-1, -1, -1)
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
data = input().split()

round = int(data[0])
cnt_house = int(data[1])

distance = input().split()

min_dist = None

for start in range(cnt_house):
  move_dist = 0
    
  for i in range(cnt_house - 1):
    if start + i == cnt_house - 1:
      move_dist += round - int(distance[start + i]) + int(distance[start + i - cnt_house + 1])
    elif start + i < cnt_house - 1:
      move_dist += int(distance[start + i + 1]) - int(distance[start + i])
    else:
      move_dist += int(distance[start + i - cnt_house + 1]) - int(distance[start + i - cnt_house])
    
    if min_dist is not None and min_dist < move_dist:
      break
  
  if min_dist is None or min_dist > move_dist:
    min_dist = move_dist

print(min_dist)

Fixed submission:
# -*- coding: utf-8 -*-
data = input().split()

round = int(data[0])
cnt_house = int(data[1])

distance = input().split()

min_dist = None

for start in range(cnt_house):
  if start == 0:
    move_dist = int(distance[cnt_house - 1]) - int(distance[start])
  else:
    move_dist = (round - int(distance[start])) + int(distance[start - 1])
  
  if min_dist is None or min_dist > move_dist:
    min_dist = move_dist

print(min_dist)

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
data = input().split()

round = int(data[0])
cnt_house = int(data[1])

distance = input().split()

min_dist = None

for start in range(cnt_house):
  move_dist = 0
    
  for i in range(cnt_house - 1):
    if start + i == cnt_house - 1:
      move_dist += round - int(distance[start + i]) + int(distance[start + i - cnt_house + 1])
    elif start + i < cnt_house - 1:
      move_dist += int(distance[start + i + 1]) - int(distance[start + i])
    else:
      move_dist += int(distance[start + i - cnt_house + 1]) - int(distance[start + i - cnt_house])
  
  if min_dist is None or min_dist > move_dist:
    min_dist = move_dist

print(min_dist)

Fixed submission:
# -*- coding: utf-8 -*-
data = input().split()

round = int(data[0])
cnt_house = int(data[1])

distance = input().split()

min_dist = None

for start in range(cnt_house):
  if start == 0:
    move_dist = int(distance[cnt_house - 1]) - int(distance[start])
  else:
    move_dist = (round - int(distance[start])) + int(distance[start - 1])
  
  if min_dist is None or min_dist > move_dist:
    min_dist = move_dist

print(min_dist)
Buggy python submission (verdict: Runtime Error):
data = input().split(" ")
A = input().split(" ")
B = input().split(" ")
total = 0
a = 0
b = 0
j = 0
for i in data:
    data[j] = int(i)
    j += 1
j = 0
for i in A:
    A[j] = int(i)
    j += 1
j = 0
for i in B:
    B[j] = int(i)
    j += 1


for i in range(data[2]):
    data1 = input().split()
    j = 0
    for i in data1:
        data1[j] = int(i)
        j += 1
    data2 = A[data1[0]-1] + B[data1[1]-1] - data1[2]
    if total > data2:
        total = data2

for i in A:
    if a > i:
        a = i
for i in B:
    if b > i:
        b = i

if total > a+b:
    total = a+b

print(total)

Fixed submission:
s = input()
data = len(s)
s = list(s)
j = 0
for i in s:
  if j%2 == 0:
    if i != "h":
      break
  if j%2 == 1:
    if i != "i":
      break
  j += 1

      
if j == data and data%2 == 0:
  print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
data = input().split(" ")
A = input().split(" ")
B = input().split(" ")
total = 100000
a = 100000
b = 100000
j = 0
for i in data:
    data[j] = int(i)
    j += 1
j = 0
for i in A:
    A[j] = int(i)
    j += 1
j = 0
for i in B:
    B[j] = int(i)
    j += 1


for i in range(data[2]):
    data1 = input().split()
    j = 0
    for i in data1:
        data1[j] = int(i)
        j += 1
    data2 = A[data1[0]-1] + B[data1[1]-1] - data1[2]
    if total > data2:
        total = data2

for i in A:
    if a > i:
        a = i
for i in B:
    if b > i:
        b = i

if total > a+b:
    total = a+b

print(total)

Fixed submission:
s = input()
data = len(s)
s = list(s)
j = 0
for i in s:
  if j%2 == 0:
    if i != "h":
      break
  if j%2 == 1:
    if i != "i":
      break
  j += 1

      
if j == data and data%2 == 0:
  print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
data = input().split(" ")
A = input().split(" ")
B = input().split(" ")
total = 100000
a = 100000
b = 100000
j = 0
for i in data:
    data[j] = int(i)
    j += 1
j = 0
for i in A:
    A[j] = int(i)
    j += 1
j = 0
for i in B:
    B[j] = int(i)
    j += 1


for i in range(data[2]):
    data1 = input().split()
    j = 0
    for i in data1:
        data1[j] = int(i)
        j += 1
    data2 = A[data1[0]-1] + B[data1[1]-1] - data1[2]
    print(data2)
    if total > data2:
        total = data2

for i in A:
    if a > i:
        a = i
for i in B:
    if b > i:
        b = i

if total > a+b:
    total = a+b

print(total)

Fixed submission:
s = input()
data = len(s)
s = list(s)
j = 0
for i in s:
  if j%2 == 0:
    if i != "h":
      break
  if j%2 == 1:
    if i != "i":
      break
  j += 1

      
if j == data and data%2 == 0:
  print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
data = input().split(" ")
A = input().split(" ")
B = input().split(" ")
total = 0
a = 0
b = 0
j = 0
for i in data:
    data[j] = int(i)
    j += 1
j = 0
for i in A:
    A[j] = int(i)
    j += 1
j = 0
for i in B:
    B[j] = int(i)
    j += 1


for i in range(data[2]):
    data1 = input().split()
    j = 0
    for i in data1:
        data1[j] = int(i)
        j += 1
    data2 = A[data1[0]] + B[data[1]] - data1[2]
    if total > data2:
        total = data2

for i in A:
    if a > i:
        a = i
for i in B:
    if b > i:
        b = i

if total > a+b:
    total = a+b

print(total)

Fixed submission:
data = input().split(" ")
A = input().split(" ")
B = input().split(" ")
total = 1000000
a = 1000000
b = 1000000
j = 0
for i in data:
    data[j] = int(i)
    j += 1
j = 0
for i in A:
    A[j] = int(i)
    j += 1
j = 0
for i in B:
    B[j] = int(i)
    j += 1


for i in range(data[2]):
    data1 = input().split()
    j = 0
    for i in data1:
        data1[j] = int(i)
        j += 1
    data2 = A[data1[0]-1] + B[data1[1]-1] - data1[2]
    if total > data2:
        total = data2

for i in A:
    if a > i:
        a = i
for i in B:
    if b > i:
        b = i

if total > a+b:
    total = a+b

print(total)

Buggy python submission (verdict: Runtime Error):
data = input().split(" ")
A = input().split(" ")
B = input().split(" ")
total = 0
a = 0
b = 0

for i in data:
    i = int(i)
for i in A:
    i = int(i)
for i in B:
    i = int(i)

for i in range(data[2]):
    data1 = input().split()
    for i in data1:
        i = int(i)
    data2 = A[data1[0]] + B[data[1]] - data1[2]
    if total > data2:
        total = data2

for i in A:
    if a > i:
        a = i
for i in B:
    if b > i:
        b = i

if total > a+b:
    total = a+b

print(total)

Fixed submission:
data = input().split(" ")
A = input().split(" ")
B = input().split(" ")
total = 1000000
a = 1000000
b = 1000000
j = 0
for i in data:
    data[j] = int(i)
    j += 1
j = 0
for i in A:
    A[j] = int(i)
    j += 1
j = 0
for i in B:
    B[j] = int(i)
    j += 1


for i in range(data[2]):
    data1 = input().split()
    j = 0
    for i in data1:
        data1[j] = int(i)
        j += 1
    data2 = A[data1[0]-1] + B[data1[1]-1] - data1[2]
    if total > data2:
        total = data2

for i in A:
    if a > i:
        a = i
for i in B:
    if b > i:
        b = i

if total > a+b:
    total = a+b

print(total)
Buggy python submission (verdict: Runtime Error):
str = input()
str_list = list(str)
 
if str_list[0] =! str_list[1]:
  print("Yes")
elif str_list[1] =! str_list[2]:
  print("Yes")
else:
  print("No")

Fixed submission:
str = input()
str_list = list(str)
 
if str_list[0] != str_list[1]:
  print("Yes")
elif str_list[1] != str_list[2]:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
str = input()
str_list = list(str)
 
if str_list[0] =! str_list[1]:
  print("Yes")
elif str_list[1] == str_list[1]:
  print("Yes")
else:
  print("No")

Fixed submission:
str = input()
str_list = list(str)
 
if str_list[0] != str_list[1]:
  print("Yes")
elif str_list[1] != str_list[2]:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
s = input()
s_list = list(str)
 
if str_list[0] == str_list[2]:
  print("Yes")
else:
  print("No")

Fixed submission:
str = input()
str_list = list(str)
 
if str_list[0] != str_list[1]:
  print("Yes")
elif str_list[1] != str_list[2]:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
str = input()
str_list = list(str)

if str_list[0] == str_ list[2]:
  print("Yes")
else:
  print("No")

Fixed submission:
str = input()
str_list = list(str)
 
if str_list[0] != str_list[1]:
  print("Yes")
elif str_list[1] != str_list[2]:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N,K=list(map(int,input().split()))
old_N=N+1
while True:
  if old_N<=N:
    print(old_N)
    break
  old_N=N
  N=abs(N-K)

Fixed submission:
N,K=list(map(int,input().split()))
n=N%K
old_n=K+1
while True:
  if old_n<=n:
    print(old_n)
    break
  old_n=n
  n=abs(n-K)
Buggy python submission (verdict: Runtime Error):
S=input()
if S[2]==S[3] && S[4]==S[5]:
  print("Yes")
else:
  print("No")

Fixed submission:
S=input()
if S[2]==S[3] and S[4]==S[5]:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
L = list(map(int, input().split()))
ans = 0
L.sort()
for i in range(N-2):
  for j in range(i+1,N-1):
    for k in range(j+1,N):
      if L[i]+L[j] > L[k] and L[k]+L[j] > L[i] and L[i]+L[k] > L[j]:
        ans = ans + 1
      else:
        break
print(ans)


Fixed submission:
A,B = list(map(int,input().split()))
ans = A - 2*B
if ans < 0:
  ans = 0
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
B = list(map(int, input().split()))
B_last = int(len(B))
A = B[0] + B[B_last - 1]
i = 1
old_b = B[1]
for i in range(N-1):
  #print("A =",A, "B =",B[i])
  b = B[i]
  if b >= old_b:
    A += old_b
    #print("A =",A)
  else:
    A += b
    #print(A)
  old_b = B[i]
  #print("A =",A, "B =",B[i],"old_b =", old_b)
#print("A =",A)
print(A)

Fixed submission:
N = int(input())
ans = pow(N, 3)
print(ans)
Buggy python submission (verdict: Runtime Error):
A,B = list(map(int,input().split()))
a = abs(A+B) % 2
if a == 1:
  print(IMPOSSIBLE)
else:
  print(int(abs(A+B)/2))

Fixed submission:
A,B = list(map(int,input().split()))
a = abs(A+B) % 2
if a == 1:
  print("IMPOSSIBLE")
else:
  print(int(abs(A+B)/2))
Buggy python submission (verdict: Runtime Error):
S = list(map(int ,input().split()))
S.sort()
if S[0] == S[1] and S[2] == S[3] and S[0] != S[2]:
  print("Yes")
else:
  print("No")

Fixed submission:
S = list(map(str ,input()))
S.sort()
if S[0] == S[1] and S[2] == S[3] and S[0] != S[2]:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N_W=list(map(int,input().split()))
N=N_W[0]
W=N_W[1]
items=[]
for i in range(N):
	sets=list(map(int,input().split()))
	items.append(sets)
knapsack=[[0 for i in range(W+1)] for j in range(N+1)]

for i in range(N):
	for w in range(1,W+1):
		if w-items[i][0]>=0:
			knapsack[i+1][w]=max(knapsack[i+1][w],knapsack[i][w],knapsack[i][w-items[i][0]]+items[i][1])
		else:
			knapsack[i+1][w]=max(knapsack[i+1][w],knapsack[i][w])
print(knapsack[-1][-1])

Fixed submission:
N_W=list(map(int,input().split()))
N=N_W[0]
W=N_W[1]
items=[]
for i in range(N):
	sets=list(map(int,input().split()))
	items.append(sets)
knapsack=[[0 for i in range(W+1)] for j in range(N+1)]

for i in range(N):
	for w in range(1,W+1):
		if w-items[i][0]>=0:
			knapsack[i+1][w]=max(knapsack[i+1][w],knapsack[i][w],knapsack[i][w-items[i][0]]+items[i][1])
		else:
			knapsack[i+1][w]=max(knapsack[i+1][w],knapsack[i][w])
print(knapsack[-1][-1])
Buggy python submission (verdict: Runtime Error):
n = input()
N = str(n)
if "7" in N:
    print(yes)
else:
    print(no)
    

Fixed submission:
n = input()
N = str(n)
if "7" in N:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = input()
N = str(n)
if 7 in N:
    print(yes)
else:
    print(no)
    

Fixed submission:
n = input()
N = str(n)
if "7" in N:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = input ()
N = str(n)
if 7 in N:
    print(yes)
else:
    print(no)
    

Fixed submission:
n = input()
N = str(n)
if "7" in N:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
N = input()
if 7 in N:
    print(yes)
else:
    print(no)


Fixed submission:
n = input()
N = str(n)
if "7" in N:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
N = input 
if 7 in N:
    print(yes)
else:
    print(no)


Fixed submission:
n = input()
N = str(n)
if "7" in N:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = input ()
N = int(n)
if 7 in N:
    print(yes)
else:
    print(no)


Fixed submission:
n = input()
N = str(n)
if "7" in N:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import math
n, d = map(int, input().split())
a = int(math.seil(n/(2*d+1)))
print(a)


Fixed submission:
n, d = map(int, input().split())
a = int((n+2*d)/(2*d+1))
print(a)

Buggy python submission (verdict: Runtime Error):

import math
n, d = map(int, input().split())
a = math.seil(n/(2*d+1))
print(a)


Fixed submission:
n, d = map(int, input().split())
a = int((n+2*d)/(2*d+1))
print(a)