Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
x , n= map(int,input().split())
p = list(map(int,input().split()))
ans = []
if n == 0:
    print(x)
else:
    for i in range(1,101):
        if i in p:
            pass
        else:
            ans.append(i)
    sa = []
    for i in range(len(ans)):
        sa.append(abs(ans[i]-x))
    MIN=min(sa)
    for i in range(len(ans)):
        if MIN == abs(ans[i]-x):
            print(ans[i])
            break

Fixed submission:
x , n= map(int,input().split())
p = list(map(int,input().split()))
ans = []
if n == 0:
    print(x)
else:
    for i in range(-10,102):
        if i in p:
            pass
        else:
            ans.append(i)
    sa = []
    for i in range(len(ans)):
        sa.append(abs(ans[i]-x))
    MIN=min(sa)
    for i in range(len(ans)):
        if MIN == abs(ans[i]-x):
            print(ans[i])
            break

Buggy python submission (verdict: Runtime Error):
x , n= map(int,input().split())
p = list(map(int,input().split()))
ans = []
if n == 0:
    print(x)
else:
    for i in range(1,101):
        if i in p:
            pass
        else:
            ans.append(i)
    sa = []
    for i in range(len(ans)):
        sa.append(abs(ans[i]-x))
    MIN=min(sa)
    for i in range(len(ans)):
        if MIN == abs(ans[i]-x):
            print(ans[i])

Fixed submission:
x , n= map(int,input().split())
p = list(map(int,input().split()))
ans = []
if n == 0:
    print(x)
else:
    for i in range(-10,102):
        if i in p:
            pass
        else:
            ans.append(i)
    sa = []
    for i in range(len(ans)):
        sa.append(abs(ans[i]-x))
    MIN=min(sa)
    for i in range(len(ans)):
        if MIN == abs(ans[i]-x):
            print(ans[i])
            break

Buggy python submission (verdict: Runtime Error):
x , n= map(int,input().split())
p = list(map(int,input().split()))
ans = []
if n == 0:
    print(x)
else:
    for i in range(1,101):
        if i in p:
            pass
        else:
            ans.append(i)
    sa = []
    for i in range(0,len(ans)):
        sa.append(abs(ans[i]-x))
    MIN=min(sa)
    for i in range(n):
        if MIN == abs(ans[i]-x):
            print(ans[i])

Fixed submission:
x , n= map(int,input().split())
p = list(map(int,input().split()))
ans = []
if n == 0:
    print(x)
else:
    for i in range(-10,102):
        if i in p:
            pass
        else:
            ans.append(i)
    sa = []
    for i in range(len(ans)):
        sa.append(abs(ans[i]-x))
    MIN=min(sa)
    for i in range(len(ans)):
        if MIN == abs(ans[i]-x):
            print(ans[i])
            break
Buggy python submission (verdict: Runtime Error):
t = input()
ans=ans.replace('P?','PD')
ans=t.replace('?D','PD')
ans=ans.replace('??','PD')
ans=ans.replace('?','D')
print(ans)

Fixed submission:
t = input()
ans=t.replace('P?','PD')
ans=ans.replace('?D','PD')
ans=ans.replace('??','PD')
ans=ans.replace('?','D')
print(ans)
Buggy python submission (verdict: Runtime Error):
s,w=map(int,input().split())
if n <= m:
  print('unsafe')
else:
  print('safe')

Fixed submission:
s,w=map(int,input().split())
if s <= w:
  print('unsafe')
else:
  print('safe')
Buggy python submission (verdict: Runtime Error):
h,w=map(int,input().split())
if (h==1 and w!=1) or (h!=1 and w==1):
    print(1)
else:
    m=h*w
    print((m+2-1)//2)

Fixed submission:
a = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(a[int(input())-1])
Buggy python submission (verdict: Runtime Error):
A,B,M=map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
xyc=[list(map(int,input().split())) for i in range(M)]
ans = []
for i in range(M):
  ans.append(a[xyc[i][0]-1]+a[xyc[i][1]-1]-xyc[i][2])
mi=min(a)+min(b)
print(min(min(ans),mi))

Fixed submission:
A,B,M=map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
xyc=[list(map(int,input().split())) for i in range(M)]
ans = []
for i in range(M):
  ans.append(a[xyc[i][0]-1]+b[xyc[i][1]-1]-xyc[i][2])
mi=min(a)+min(b)
print(min(min(ans),mi))
Buggy python submission (verdict: Time Limit Exceeded):
a,b=map(int,input().split())
for i in range(1,10**7):
  if int(0.08*i)==a and int(0.1*i)==b:
    print(i)
    exit()
print(-1)

Fixed submission:
a,b=map(int,input().split())
for i in range(1,10**8):
  if int(0.08*i)==a and int(0.1*i)==b:
    print(i)
    exit()
print(-1)

Buggy python submission (verdict: Time Limit Exceeded):
a,b=map(int,input().split())
for i in range(1,10**8):
  if int(0.08*i)==a and int(0.1*i)==b:
    print(i)
    exit()
print(-1)

Fixed submission:
a,b=map(int,input().split())
for i in range(1,10**8):
  if int(0.08*i)==a and int(0.1*i)==b:
    print(i)
    exit()
print(-1)
Buggy python submission (verdict: Runtime Error):
def framod(n, mod, a=1):
    for i in range(1,n+1):
        a=a * i % mod
    return a

def power(n, r, mod):
    if r == 0: return 1
    if r%2 == 0:
        return power(n*n % mod, r//2, mod) % mod
    if r%2 == 1:
        return n * power(n, r-1, mod) % mod

def comb(n, k, mod):
    a=framod(n, mod)
    b=framod(k, mod)
    c=framod(n-k, mod)
    return (a * power(b, mod-2, mod) * power(c, mod-2, mod)) % mod
n,a,b=map(int,input().split())
modd = 10**9+7
print(2**n-comb(n,a,modd)-comb(n,b,modd)-1)

Fixed submission:
n,k = map(int,input().split())
if n >= 10:
    print(k)
else:
    print(100*(10-n)+k)
Buggy python submission (verdict: Time Limit Exceeded):
n= int(input())
s = [input()for i in range(n)]
t = set(s)
t=sorted(t)
ans =[]
for i in t:
    ans.append(s.count(i))
mx = max(ans)
for i in range(len(t)):
    if mx == ans[i]:
        print(t[i])

Fixed submission:
from collections import Counter

def print_cnt(l):
    counter = Counter(l)
    max_cnt = counter.most_common(1)[0][1]
    ret = [v for v,c in counter.most_common() if c == max_cnt] # 最多２個以上にするなら ～if c > 1 and c == max_cnt
    ret=sorted(ret)
    for a in ret:
        print(a)


n = int(input())
print_cnt([input()for i in range(n)])
Buggy python submission (verdict: Runtime Error):
import numpy

n,k = map(int,input().split())
p = list(map(int,input().split()))
q = []
for i in range(n):
    q.append(((((p[i]+1)*p[i])/2)/p[i]))
res = numpy.cumsum(q)
print(q)
ans = []
ans.append(q[k-1])
for i in range(k,n):
  ans.append(res[i]-res[i-k])
print(max(ans))

Fixed submission:
import numpy

n,k = map(int,input().split())
p = list(map(int,input().split()))
q = []
for i in range(n):
    q.append(((((p[i]+1)*p[i])/2)/p[i]))

res = numpy.cumsum(q)
ans = []
ans.append(res[k-1])
for i in range(k,n):
  ans.append(res[i]-res[i-k])
print(max(ans))

Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
p = list(map(int,input().split()))
sum = 0
ans = []
for i in range(n-(k-1)):
    sum = 0
    for j in range(i,i+k):
        sum += ((((p[j]+1)*p[j])/2)/p[j])
    ans.append(sum)
print(max(ans))


Fixed submission:
import numpy

n,k = map(int,input().split())
p = list(map(int,input().split()))
q = []
for i in range(n):
    q.append(((((p[i]+1)*p[i])/2)/p[i]))

res = numpy.cumsum(q)
ans = []
ans.append(res[k-1])
for i in range(k,n):
  ans.append(res[i]-res[i-k])
print(max(ans))

Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
p = list(map(int,input().split()))
sum = 0
ans = []
for i in range(n-(k-1)):
    sum = 0
    for j in range(i,i+k):
        sum += ((((p[j]+1)*p[j])/2)/p[j])
    ans.append(sum)
print(max(ans))

Fixed submission:
import numpy

n,k = map(int,input().split())
p = list(map(int,input().split()))
q = []
for i in range(n):
    q.append(((((p[i]+1)*p[i])/2)/p[i]))

res = numpy.cumsum(q)
ans = []
ans.append(res[k-1])
for i in range(k,n):
  ans.append(res[i]-res[i-k])
print(max(ans))
Buggy python submission (verdict: Runtime Error):
h,n=map(int,input().split())
a=list(map(int,input().split()))
a = sorted(a)
if h == 210 and n ==3:
    print('Yes')
elif a[-1]+a[-2] >= h:
    print('Yes')
else:print('No')

Fixed submission:
h,n=map(int,input().split())
a=list(map(int,input().split()))
a = sorted(a)
if n == 1:
    if a[0] >= h:
        print('Yes')
    else:
        print('No')

elif sum(a) >= h:
    print('Yes')
else:print('No')
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
if n =< m:
  print('Yes')
else:
  print('No')

Fixed submission:
n,m = map(int,input().split())
if n <= m:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
print(chr(ord((input())+1))

Fixed submission:
print(chr(ord(input())+1))
Buggy python submission (verdict: Runtime Error):
a,b =int(input())
if a * 500 >= b:
  print('Yes')
else:print('No')

Fixed submission:
a,b =map(int,input().split())
if a * 500 >= b:
  print('Yes')
else:print('No')
Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
if a <= k:
  print(0,end=' ')
else:
  print(a-k,end=' ')
s = a+b
if s > k:
  print(s-k)
else:
  print(0)


Fixed submission:
s,t=input().split()
print(t+s)

Buggy python submission (verdict: Runtime Error):
s,t=map(int,input())
print(t+s)

Fixed submission:
s,t=input().split()
print(t+s)

Buggy python submission (verdict: Runtime Error):
s=input()
t=input()
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())
takahasi = k-a
if takahasi < 0:
  print(0,end=' ')
else:
  print(takahasi)
s = a+b
if s - k < 0
  print(0)
else:
  print(s-k)

Fixed submission:
a,b,k=map(int,input().split())
if a >= k:
  a -= k
else:
  b=max(b-(k-a),0)
  a=0
print("{} {}".format(a,b))
Buggy python submission (verdict: Runtime Error):
import numpy as np
a,b= map(int,input().split())
lcm = np.lcm(a, b)
print(lcm)

Fixed submission:
a = int(input())
b = int(input())
if a + b == 3:
    print(3)
elif a+b == 4:
    print(2)
else:
    print(1)
Buggy python submission (verdict: Runtime Error):
import math
a,b= map(int,input().split())
print(a*b//math.gcd(a,b))


Fixed submission:

def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

def lcm(a, b):
    return a * b // gcd (a, b)
a,b = map(int,input().split())
print(lcm(a,b))

Buggy python submission (verdict: Runtime Error):
import numpy as np
a,b= map(int,input().split())
lcm = np.lcm(a, b)
print(lcm)

Fixed submission:

def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

def lcm(a, b):
    return a * b // gcd (a, b)
a,b = map(int,input().split())
print(lcm(a,b))

Buggy python submission (verdict: Runtime Error):
import math
a,b= map(int,input().split())
print(a*b/math.gcd(a,b))

Fixed submission:

def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

def lcm(a, b):
    return a * b // gcd (a, b)
a,b = map(int,input().split())
print(lcm(a,b))

Buggy python submission (verdict: Runtime Error):
import math
a,b= map(int,input().split())
print(a*b//math.gcd(a,b))

Fixed submission:

def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

def lcm(a, b):
    return a * b // gcd (a, b)
a,b = map(int,input().split())
print(lcm(a,b))

Buggy python submission (verdict: Runtime Error):
import math
a,b= map(int,input().split())
print(a*b//math.gcd(a,b))

Fixed submission:

def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

def lcm(a, b):
    return a * b // gcd (a, b)
a,b = map(int,input().split())
print(lcm(a,b))
Buggy python submission (verdict: Time Limit Exceeded):
import math
n = int(input())
sum = 1

if n % 2 == 1:
    print(0)
else:
    n = math.factorial(n//2)
    count = 0
    while n % 5 == 0:
        count+=1
        n//=5
    print(count)

Fixed submission:
n = int(input())

if n % 2 == 1:
    print(0)
else:
    count = 0
    n=n//2
    while n // 5 != 0:
        count += n // 5
        n//=5
    print(count)

Buggy python submission (verdict: Time Limit Exceeded):
import math
n = int(input())
sum = 1

if n % 2 == 1:
    print(0)
else:
    n = math.factorial(n//2)
    count = 0
    while n % 5 == 0:
        count+=1
        n//=5
    print(count)

Fixed submission:
n = int(input())

if n % 2 == 1:
    print(0)
else:
    count = 0
    n=n//2
    while n // 5 != 0:
        count += n // 5
        n//=5
    print(count)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())

if(a+b+c>=22):
    print('bust')
else:
    print('win')

Fixed submission:
a,b,c = map(int,input().split())
if(a+b+c>=22):
    print('bust')
else:
    print('win')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
A = list(map(int, input().split()))
ans = 0
for j in range(61):
  ones = 0
  for i in A:
    if i>>j & 1:
      ones += 1
  ans += 2**j*((n-ones)*ones)
print(ans%(10**9+7))

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
ans = 0
for j in range(61):
  ones = 0
  for i in A:
    if i>>j & 1:
      ones += 1
  ans += 2**j*((n-ones)*ones)
print(ans%(10**9+7))

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a = list(map(int,input().split()))

sum = 0
for i in range(0,n-1):
    k=i+1
    for j in range(k,n):
        sum += a[i]^a[j]
        sum = sum%(10**9+7)
print(sum%(10**9+7))

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
ans = 0
for j in range(61):
  ones = 0
  for i in A:
    if i>>j & 1:
      ones += 1
  ans += 2**j*((n-ones)*ones)
print(ans%(10**9+7))

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a = list(map(int,input().split()))

sum = 0
for i in range(0,n-1):
    k=i+1
    for j in range(k,n):
        sum  += a[i]^a[j]
print(sum%(10**9+7))

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
ans = 0
for j in range(61):
  ones = 0
  for i in A:
    if i>>j & 1:
      ones += 1
  ans += 2**j*((n-ones)*ones)
print(ans%(10**9+7))

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a = list(map(int,input().split()))

sum = 0
for i in range(0,n-1):
    k=i+1
    for j in range(k,n):
        sum  += a[i]^a[j]
print(sum%(10**9+7))

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
ans = 0
for j in range(61):
  ones = 0
  for i in A:
    if i>>j & 1:
      ones += 1
  ans += 2**j*((n-ones)*ones)
print(ans%(10**9+7))
Buggy python submission (verdict: Runtime Error):
import math
n = int(input())
r = list()
for a in range(1,int(math.sqrt(n))):
    if n % a == 0:
        b = n//a
        r.append(a+b-2)
print(min(r))

Fixed submission:
import math
n = int(input())
r = list()
for a in range(1,int(math.sqrt(10**12)+1)):
    if n % a == 0:
        b = n//a
        r.append(a+b-2)
print(min(r))
Buggy python submission (verdict: Time Limit Exceeded):
n,k,q = map(int,input().split())
a = [int(input()) for i in range(q)]
p = [k] * n
for t in range(q):
    for j in range(0,n):
        if j == a[t]-1:
            pass
        else:
            p[j]-=1
for r in p:
    if r <= 0:
        print('No')
    else:
        print('Yes')

Fixed submission:
n,k,q = map(int,input().split())
a = [int(input()) for i in range(q)]
p = [k-q] * n

for j in range(q):
    p[a[j]-1]+=1

for r in p:
    if r >= 1:
        print('Yes')
    else:
        print('No')

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q = map(int,input().split())
a = [int(input()) for i in range(q)]
p = [k] * n
for t in range(q):
    for j in range(0,n):
        if j == a[t]-1:
            pass
        else:
            p[j]-=1
for r in p:
    if r <= 0:
        print('No')
    else:
        print('Yes')

Fixed submission:
n,k,q = map(int,input().split())
a = [int(input()) for i in range(q)]
p = [k-q] * n

for j in range(q):
    p[a[j]-1]+=1

for r in p:
    if r >= 1:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int,input().split()))

ans = []
count = 0
for i in range(n-1):
  if h[i] >= h[i+1]:
    print(h[i])
    print(h[i+1])
    count+=1
  elif h[i] <= h[i+1]:
    ans.append(count)
    count = 0
  else:
    ans.append(count)
    
print(max(ans))

Fixed submission:
n = int(input())
h = list(map(int,input().split()))
ans = []
ans.append(0)
count = 0
for i in range(n-1):
  if h[i] >= h[i+1]:
    count += 1
    ans.append(count)
  else:
    count=0
print(max(ans))

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

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

Fixed submission:
n = int(input())
h = list(map(int,input().split()))
ans = []
ans.append(0)
count = 0
for i in range(n-1):
  if h[i] >= h[i+1]:
    count += 1
    ans.append(count)
  else:
    count=0
print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map,int(input().split()))
for i in range(,n-1):
ans = 0
  if h[i] >= h[i+1]:
    ans += count:
  else:
    break
print(ans)

Fixed submission:
n = int(input())
h = list(map(int,input().split()))
ans = []
ans.append(0)
count = 0
for i in range(n-1):
  if h[i] >= h[i+1]:
    count += 1
    ans.append(count)
  else:
    count=0
print(max(ans))

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

Fixed submission:
n = int(input())
h = list(map(int,input().split()))
ans = []
ans.append(0)
count = 0
for i in range(n-1):
  if h[i] >= h[i+1]:
    count += 1
    ans.append(count)
  else:
    count=0
print(max(ans))
Buggy python submission (verdict: Runtime Error):
n= int(input())
a = [int(input()) for i in range(n)]
b=sorted(a,reverse=True)
for i in range(n):
  if a[i] = b[0]:
    print(b[1])
  else:
    print(b[0])

Fixed submission:
n= int(input())
a = [int(input()) for i in range(n)]
b=sorted(a,reverse=True)
for i in range(n):
  if a[i] == b[0]:
    print(b[1])
  else:
    print(b[0])

Buggy python submission (verdict: Time Limit Exceeded):
n= int(input())
a = [int(input()) for i in range(n)]
for i in range(n):
  b=a.pop(i)
  print(max(a))
  a.insert(i,b)


Fixed submission:
n= int(input())
a = [int(input()) for i in range(n)]
b=sorted(a,reverse=True)
for i in range(n):
  if a[i] == b[0]:
    print(b[1])
  else:
    print(b[0])

Buggy python submission (verdict: Time Limit Exceeded):
n= int(input())
a = [int(input()) for i in range(n)]
for i in range(n):
  b=a.pop(i)
  print(max(a))
  a.insert(i,b)

Fixed submission:
n= int(input())
a = [int(input()) for i in range(n)]
b=sorted(a,reverse=True)
for i in range(n):
  if a[i] == b[0]:
    print(b[1])
  else:
    print(b[0])
Buggy python submission (verdict: Runtime Error):
s=input()
s=sorted(s)

if s[0]==s[1] and s[2]==s[3] and a[0] != s[2]:
	print("Yes")
else:
	print("No")

Fixed submission:
s=input()
s=sorted(s)

if s[0]==s[1] and s[2]==s[3] and s[0] != s[2]:
	print("Yes")
else:
	print("No")

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

if s[0]==s[1] and s[2]==s[3] and a[0] != s[2]:
	print("Yes")
else:
	print("No")

Fixed submission:
s=input()
s=sorted(s)

if s[0]==s[1] and s[2]==s[3] and s[0] != s[2]:
	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
s=input()
s=sorted(s)
if s[0]==s[1] and s[2]==s[3]:
　print("Yes")
else:
　print("No")

Fixed submission:
s=input()
s=sorted(s)

if s[0]==s[1] and s[2]==s[3] and s[0] != s[2]:
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
s=input()
sento1 = 0
sento0 = 0
for i in range(len(s)):

  if i % 2 == 0:
    
    if s[i] == '1':
      sento1 += 1
      
    elif s[i] == '0':
      sento0 += 1
      
  else:
    if s[i] == '0':
      sento1 += 1
    elif s[i] == '1'
      sento0 += 1
      
print(min(sento1,sento0))

Fixed submission:
s=input()
sento1 = 0
sento0 = 0
for i in range(len(s)):

  if i % 2 == 0:
    
    if s[i] == '1':
      sento1 += 1
      
    elif s[i] == '0':
      sento0 += 1
      
  else:
    if s[i] == '0':
      sento1 += 1
    elif s[i] == '1':
      sento0 += 1
      
print(min(sento1,sento0))
Buggy python submission (verdict: Runtime Error):
a={"A":"T","T":"A","C":"G","G":"C"}
print(b[input()])

Fixed submission:
a={"A":"T","T":"A","C":"G","G":"C"}
print(a[input()])
Buggy python submission (verdict: Runtime Error):
n = int(input())
l = list(map(int,input().split()))w
if max(l) >= sum(l)-max(l):
  print('No')
else:
  print('Yes')

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
if max(l) >= sum(l)-max(l):
  print('No')
else:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
b=｛25:"Christmas",24:"Christmas Eve",23:"Christmas Eve Eve",22:"Christmas Eve Eve Eve"｝
print(b[int(input())]

Fixed submission:
b={25:"Christmas",24:"Christmas Eve",23:"Christmas Eve Eve",22:"Christmas Eve Eve Eve"}
print(b[int(input())])

Buggy python submission (verdict: Runtime Error):
b=｛25:"Christmas",24:"Christmas Eve",23:"Christmas Eve Eve",22:"Christmas Eve Eve Eve"｝
print(b[int(input())])

Fixed submission:
b={25:"Christmas",24:"Christmas Eve",23:"Christmas Eve Eve",22:"Christmas Eve Eve Eve"}
print(b[int(input())])

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=｛25:"Christmas",24:"Christmas Eve",23:"Christmas Eve Eve",22:"Christmas Eve Eve Eve"｝
print(b[int(input())])

Fixed submission:
b={25:"Christmas",24:"Christmas Eve",23:"Christmas Eve Eve",22:"Christmas Eve Eve Eve"}
print(b[int(input())])
Buggy python submission (verdict: Runtime Error):
n=int(input())
if n==1:print("Hello World")exit()
else:print(int(input())+int(input()))

Fixed submission:
n=int(input())
if n==1:print("Hello World")
else:print(int(input())+int(input()))
Buggy python submission (verdict: Runtime Error):
n=int(input())
for i in range(3):
  if n[i] == 1:print(9,end='')
  else:print(print(1,end=''))


Fixed submission:
n=input()
for i in range(3):
  if int(n[i]) == 1:print(9,end='')
  else:print(1,end='')

Buggy python submission (verdict: Runtime Error):
n=int(input())
for i in range(len(n)):
  if n[i] == 1:print(9,end='')
  else:print(print(1,end=''))

Fixed submission:
n=input()
for i in range(3):
  if int(n[i]) == 1:print(9,end='')
  else:print(1,end='')
Buggy python submission (verdict: Runtime Error):
a=list(input().split())
a=sorted(a)
print(int(a[2])+int(a[0]+a[1])))

Fixed submission:
a=list(input().split())
a=sorted(a)
print(int(a[0])+int(a[2]+a[1]))

Buggy python submission (verdict: Runtime Error):
a=list(input().split()))
a=sorted(a)
print(int(a[2])+int(a[0]+a[1])))

Fixed submission:
a=list(input().split())
a=sorted(a)
print(int(a[0])+int(a[2]+a[1]))
Buggy python submission (verdict: Runtime Error):
s=input()
k=int(input())
if s.count('1') == len(s):
  print(1)
else:
  count = 0
  for i in s:
    if i != '1':
      print(i)
      break
    else:
      count+=1
      if count == k:
        print(1)
        break

Fixed submission:
a,b=map(int,input().split())
print((a-1)*(b-1))
Buggy python submission (verdict: Runtime Error):
 s=input()
k=int(input())
if s.count('1') == len(s):
  print(1)
else:
  count = 0
  for i in s:
    if i != '1':
      print(i)
      break
    else:
      count+=1
      if count == k:
        print(1)
        break

Fixed submission:
s=input()
k=int(input())
if s.count('1') == len(s):
  print(1)
else:
  count = 0
  for i in s:
    if i != '1':
      print(i)
      break
    else:
      count+=1
      if count == k:
        print(1)
        break
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split)
print(a%b)

Fixed submission:
a,b=map(int,input().split())
if a%b==0:print(0)
else:print(1)
Buggy python submission (verdict: Runtime Error):
sum = 0
a = {'-':-1,'+':1}
s=input()
for i in len(s):
  sum+=a[s[i]]
print(sum)


Fixed submission:
sum = 0
a = {'-':-1,'+':1}
s=input()
for i in range(len(s)):
  sum+=a[s[i]]
print(sum)

Buggy python submission (verdict: Runtime Error):
sum = 0
a = ['-':-1,'+':1]
s=input()
for i in len(s):
  sum+=a[s[i]]
print(sum)

Fixed submission:
sum = 0
a = {'-':-1,'+':1}
s=input()
for i in range(len(s)):
  sum+=a[s[i]]
print(sum)