Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a,b=[int(i) for i in input().split()]
if a>b:
    print('GREATER')
elif a<b:
    print('LESS')
else:
    print('EQUAL')


Fixed submission:
a, b = [int(input()) for i in range(2)]
if a > b:
    print('GREATER')
elif a < b:
    print('LESS')
else:
    print('EQUAL')

Buggy python submission (verdict: Runtime Error):
a,b=[int(i) for i in input().split()]
if a>b:
    print('GREATER')
elif a<b:
    print('LESS')
else:
    print('EQUAL')


Fixed submission:
a, b = [int(input()) for i in range(2)]
if a > b:
    print('GREATER')
elif a < b:
    print('LESS')
else:
    print('EQUAL')
Buggy python submission (verdict: Time Limit Exceeded):
import math
N = int(input())
n = int(math.sqrt(N))
if N/n == n:
    print(int(math.log10(n)+1))
else:
    while N%n != 0:
        n+=1
    print(int(math.log10(n) + 1))


Fixed submission:
import math

N = int(input())
n = int(math.sqrt(N)) + 1
if N / n == n:
    print(int(math.log10(n) + 1))
else:
    while N % n != 0:
        n -= 1
    print(int(math.log10(N/n) + 1))
Buggy python submission (verdict: Runtime Error):
def solve(n, m, NUM):
    for i in range(len(m)):
        if n[NUM + i] is not m[i]:
            return -1
    return 1


N, M = [int(i) for i in input().split()]
n_pic = [input() for i in range(N)]
m_pic = [input() for i in range(M)]
num = 0
if M is 1:
    for n in n_pic:
        if -1 is not n.find(m_pic[0]):
            print('Yes')
            exit()
    print('No')
    exit()

for n in range(len(n_pic)):
    for n_len in range(N - M + 1):
        while -1 is not solve(n_pic[n+num], m_pic[num], n_len):
            num += 1
            print(num)
            if num is M:
                print('Yes')
                exit()
        num = 0
print('No')


Fixed submission:
def solve(n, m, NUM):
    for i in range(len(m)):
        if n[NUM + i] is not m[i]:
            return -1
    return 1


N, M = [int(i) for i in input().split()]
n_pic = [input() for i in range(N)]
m_pic = [input() for i in range(M)]
num = 0
if M is 1:
    for n in n_pic:
        if -1 is not n.find(m_pic[0]):
            print('Yes')
            exit()
    print('No')
    exit()

for n in range(N - M + 1):
    for n_len in range(N - M + 1):
        while -1 is not solve(n_pic[n + num], m_pic[num], n_len):
            num += 1
            if num is M:
                print('Yes')
                exit()
        num = 0
print('No')

Buggy python submission (verdict: Runtime Error):
def solve(n, m, NUM):
    for i in range(len(m)):
        if n[NUM + i] is not m[i]:
            return -1
    return 1


N, M = [int(i) for i in input().split()]
n_pic = [input() for i in range(N)]
m_pic = [input() for i in range(M)]
num = 0
if M is 1:
    for n in n_pic:
        if -1 is not n.find(m_pic[0]):
            print('Yes')
            exit()
    print('No')
    exit()

for n in n_pic:
    for n_len in range(N - M + 1):
        while -1 is not solve(n, m_pic[num], n_len):
            num += 1
        if num is M - 1:
            print('Yes')
            exit()
        num = 0
print('No')


Fixed submission:
def solve(n, m, NUM):
    for i in range(len(m)):
        if n[NUM + i] is not m[i]:
            return -1
    return 1


N, M = [int(i) for i in input().split()]
n_pic = [input() for i in range(N)]
m_pic = [input() for i in range(M)]
num = 0
if M is 1:
    for n in n_pic:
        if -1 is not n.find(m_pic[0]):
            print('Yes')
            exit()
    print('No')
    exit()

for n in range(N - M + 1):
    for n_len in range(N - M + 1):
        while -1 is not solve(n_pic[n + num], m_pic[num], n_len):
            num += 1
            if num is M:
                print('Yes')
                exit()
        num = 0
print('No')
Buggy python submission (verdict: Time Limit Exceeded):
N, Ma, Mb = [int(i) for i in input().split()]
medic = [0] * N
for i in range(N):
    medic[i] = [int(i) for i in input().split()]
cost = [[float('inf')] * 401 for _ in range(401)]


def solve(a, b, num, c):
    if num is N:
        return 0
    for i in range(2):
        if i is 0:
            cost[a + medic[num][0]][b + medic[num][1]] = min(cost[a + medic[num][0]][b + medic[num][1]],
                                                             c + medic[num][2])
            solve(a + medic[num][0], b + medic[num][1], num + 1, cost[a + medic[num][0]][b + medic[num][1]])
        else:
            solve(a, b, num + 1, c)

    return 0


solve(0, 0, 0, 0)
ans = float('inf')
for i in range(400 // max(Ma, Mb)):
    ans = min(ans, cost[Ma * i][Mb * i])
if ans > 1000:
    print(-1)
else:
    print(ans)


Fixed submission:
N, Ma, Mb = [int(i) for i in input().split()]
a, b, c = [], [], []
for i in range(N):
    a_, b_, c_ = [int(i) for i in input().split()]
    a.append(a_)
    b.append(b_)
    c.append(c_)
cost = [[float('inf')] * 401 for _ in range(401)]


def solve():
    max_a, max_b = 1, 1
    for num in range(N):
        for ca in range(max_a, -1, -1):
            for cb in range(max_b, -1, -1):
                cost[ca + a[num]][cb + b[num]] = min(cost[ca][cb] + c[num], cost[ca + a[num]][cb + b[num]])
        cost[a[num]][b[num]] = min(cost[a[num]][b[num]], c[num])
        max_a += a[num]
        max_b += b[num]


solve()
ans = float('inf')
most = ans
for i in range(1, 401):
    for n in range(1, 401):
        if i * Mb is n * Ma:
            ans = min(ans, cost[i][n])
if ans is most:
    print(-1)
else:
    print(ans)
Buggy python submission (verdict: Runtime Error):
N, M = [int(i) for i in input().split()]
road = [list() for i in range(N + 1)]
for i in range(M):
    a, b = [int(i) for i in input().split()]
    road[a].append(b)
    road[b].append(a)


def solve(before, visited, now):
    visited.append(now)
    print(visited)
    if len(visited) is N:
        return 1
    pattern = 0
    for way in road[now]:
        if way is now:
            continue
        if way in visited:
            continue
        pattern += solve(now, visited[:], way)
    return pattern


print(solve(0, [], 1))


Fixed submission:
x = int(input())
if x < 7:
    print(1)
    exit()
elif x % 11 is 0:
    print((x // 11) * 2)
elif x % 11 < 7:
    print((x // 11) * 2 + 1)
else:
    print((x // 11) * 2 + 2)
Buggy python submission (verdict: Time Limit Exceeded):
k, s = [int(i) for i in input().split()]
ans = 0
for x in range(k, -1, -1):
    for y in range(k, -1, -1):
        for z in range(k, -1, -1):
            if x + y + z is s:
                ans += 1
print(ans)


Fixed submission:
k, s = [int(i) for i in input().split()]
ans = 0
for x in range(k, -1, -1):
    for y in range(k, -1, -1):
        if 0 <= s - x - y <= k:
            ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = [int(i) for i in input().split()]
A.sort()
old, check = 0, 0
if len(A) % 2 is 1:
    if A[0] is not 0 or A[1] is not 2:
        print(0)
        exit()
    else:
        for i in range(1, N):
            if old is A[i] and check <= 1:
                check += 1
            elif old + 2 is A[i] and check <= 1:
                old = A[i]
                check = 0
            else:
                print(0)
                exit()

        print(2 ** ((N - 1) // 2))
else:
    old = -1
    for i in range(N):
        if old is A[i] and check <= 1:
            check += 1
        elif old + 2 is A[i] and check <= 1:
            old = A[i]
            check = 0
        else:
            print(0)
            exit()
    print(2 ** (N // 2))


Fixed submission:
N = int(input())
A = [int(i) for i in input().split()]
mod = 10 ** 9 + 7
A.sort()


def solve(i, num):
    while i < len(A):
        if A[i] == num:
            if A[i + 1] == num:
                i += 2
                num += 2
            else:
                break
        else:
            break
    if i >= len(A):
        print(2 ** (N // 2) % mod)
    else:
        print(0)


if len(A) % 2 is 0:
    solve(0, 1)
else:
    if A[0] is 0:
        solve(1, 2)
    else:
        print(0)
Buggy python submission (verdict: Time Limit Exceeded):
S = input()
list = []
a = 0
for i in range(len(S)):
    list.append(S[i])

while True:
    b = a
    for i in range(len(S)-1):
        if list[i]=='B' and list[i+1]=='W':
            list[i]='W'
            list[i+1]='B'
            a += 1
    if a == b:break
print(a)


Fixed submission:
S = input()
list = []
a,b = 0,0
for i in range(len(S)):
    list.append(S[i])

for i in range(len(list)):
    if list[i]=='W':
        a += i
        a -= b
        b += 1
print(a)
Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
S = input()
T = input()
ans = 0
a = 2

if S[0] != T[0]:ans = -1

elif N % M != 0 and M % N != 0:
    if N >= M:
        while True:
            if N * a % M == 0:
                ans = N * a
                b = int(N*a/M)
                for i in range(M):
                    if T[i] != S[b*i]:
                        ans = -1
                        break
                break
            else:
                a += 1
    elif N < M:
        while True:
            if M * a % N == 0:
                ans = M * a
                b = int(M*a/N)
                for i in range(N):
                    if S[i] != T[b*i]:
                        ans = -1
                        break
                break
            else:
                a += 1

elif N % M == 0:
    b = int(N/M)
    ans = N
    for i in range(M):
        if T[i] != S[b*i]:
            ans = -1
            break   

elif M % N == 0:
    b = int(M/N)
    ans = M
    for i in range(N):
        if S[i] != T[b*i]:
            ans = -1
            break   

print(ans)


Fixed submission:
N,M = map(int,input().split())
S = input()
T = input()
ans = 0
a = 2

if S[0] != T[0]:ans = -1

elif N % M != 0 and M % N != 0:
    if N >= M:
        while True:
            if N * a % M == 0:
                ans = N * a
                b = int(N*a/M)
                for i in range(int(N/b)):
                    if T[a*i] != S[b*i]:
                        ans = -1
                        break
                break
            else:
                a += 1
    elif N < M:
        while True:
            if M * a % N == 0:
                ans = M * a
                b = int(M*a/N)
                for i in range(int(M/b)):
                    if T[b*i] != S[a*i]:
                        ans = -1
                        break
                break
            else:
                a += 1

elif N % M == 0:
    b = int(N/M)
    ans = N
    for i in range(M):
        if T[i] != S[b*i]:
            ans = -1
            break   

elif M % N == 0:
    b = int(M/N)
    ans = M
    for i in range(N):
        if S[i] != T[b*i]:
            ans = -1
            break   

print(ans)
Buggy python submission (verdict: Runtime Error):
def gcd(a,b):
     
    # Everything divides 0 
    if (a == 0 or b == 0):
        False
    # base case
    if (a == b):
        return a
 
    # a is greater
    if (a > b):
        return gcd(a-b, b)
    return gcd(a, b-a)
for _ in range(int(input())):
    a,b,c,d=[int(x) for x in input().split()]
    if a<b:
        print("No")
        continue
    if d<b:
        print("No")
        continue
    if b<=c:
        print("Yes")
        continue
    g=gcd(b,d)
    if c>=b-g+a%g:
        print("Yes")
    else:
        print("No")

Fixed submission:
def gcd(a, b): 
    if a == 0 :
        return b 
    return gcd(b%a, a)
for _ in range(int(input())):
    a,b,c,d=[int(x) for x in input().split()]
    if a<b:
        print("No")
        continue
    if d<b:
        print("No")
        continue
    if b<=c:
        print("Yes")
        continue
    g=gcd(b,d)
    if c>=b-g+a%g:
        print("Yes")
    else:
        print("No")

Buggy python submission (verdict: Runtime Error):
import math
for _ in range(int(input())):
    a,b,c,d=[int(x) for x in input().split()]
    if a<b:
        print("No")
        continue
    if d<b:
        print("No")
        continue
    if b<=c:
        print("Yes")
        continue
    g=math.gcd(b,d)
    if c>=b-g+a%g:
        print("Yes")
    else:
        print("No")

Fixed submission:
def gcd(a, b): 
    if a == 0 :
        return b 
    return gcd(b%a, a)
for _ in range(int(input())):
    a,b,c,d=[int(x) for x in input().split()]
    if a<b:
        print("No")
        continue
    if d<b:
        print("No")
        continue
    if b<=c:
        print("Yes")
        continue
    g=gcd(b,d)
    if c>=b-g+a%g:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
num = N+1price = []
for i in range (1,num):
  price.append(int(input()))
else:
  exp = max(price)//2
  total = sum(price) - exp
  print(total)

Fixed submission:
N = int(input())
max_item = 0
sum_item = 0
for _ in range(N):
  c = int(input())
  sum_item += c
  max_item = max(c, max_item)

sum_item -= max_item // 2 
print(sum_item)
Buggy python submission (verdict: Runtime Error):
print((int(input())+int(input()))*int(input())//2) 

Fixed submission:
meal_fee=800
cash_back=200
cash_back_count=15
N=int(input())
x=N*meal_fee
y=int(N/cash_back_count) * cash_back
print(x-y)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = 1
for i in range(1, N+1):
  P *= i
print(P%(10**9+7))

Fixed submission:
N = int(input())
P = 1
for i in range(1, N+1):
  P *= i
  P %= 10**9+7
print(P)
Buggy python submission (verdict: Runtime Error):
c = input() 
msg = 'vowel' if ((c == 'a') or (c == 'i') or (c == 'u') or (c == 'e') or (c == 'o')) else 'consonant':
print(msg)

Fixed submission:
print(['vowel','consonant'][not input() in ['a','e','i','o','u']])

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

if (c == 'a'): 
elif (c == 'i'):
elif (c == 'u'):
elif (c == 'e'):
elif (c == 'o'): 
    is_vowel = True
else:
    is_vowel = False

if is_vowel:
    print('vowel')
else:
    print('consonant')

Fixed submission:
print(['vowel','consonant'][not input() in ['a','e','i','o','u']])
Buggy python submission (verdict: Runtime Error):
D = input()
D = int(D)

if D == 25:
  print('Christmas')

else D <= 25:
  D = 25 - D
  print ('Christmas' + D * 'Eve')

Fixed submission:
D = input()
D = int(D)

D = 25 - D

print ('Christmas' + ' Eve'* D)
Buggy python submission (verdict: Runtime Error):
n=input()
n=int(n)

if n=3 or 5 or 7:
  print('YES')
  
else:
  print('NO')

Fixed submission:
n=input()
n=int(n)

if n==3 or n==5 or n==7:
  print('YES')
  
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
D=input()
if D=="22":
  print("Christmas Eve Eve Eve")
elif D=="23":
  print(Christmas Eve Eve")
elif D=="24":
  print("Christmas Eve")
else:
  print'"Christmas")

Fixed submission:
D=input()
if D=="22":
  print("Christmas Eve Eve Eve")
elif D=="23":
  print("Christmas Eve Eve")
elif D=="24":
  print("Christmas Eve")
else:
  print("Christmas")

Buggy python submission (verdict: Runtime Error):
D=input()
if D="22":
  print("Christmas Eve Eve Eve")
elif D="23":
  print(Christmas Eve Eve")
elif D="24":
  print("Christmas Eve")
else:
  print'"Christmas")

Fixed submission:
D=input()
if D=="22":
  print("Christmas Eve Eve Eve")
elif D=="23":
  print("Christmas Eve Eve")
elif D=="24":
  print("Christmas Eve")
else:
  print("Christmas")
Buggy python submission (verdict: Runtime Error):
a, b = map(int,input().split())
if (a*b)%2 =0 :
    print("Odd")
else:
    print("Even")


Fixed submission:
a, b = map(int,input().split())
if (a*b)%2 :
    print("Odd")
else:
    print("Even")

Buggy python submission (verdict: Runtime Error):
a, b = map(int,input(),split())
if (a*b) % 2 == 0:
    print("Odd")
else:
    print("Even")


Fixed submission:
a, b = map(int,input().split())
if (a*b)%2 :
    print("Odd")
else:
    print("Even")

Buggy python submission (verdict: Runtime Error):
a, b = map(int,input(),split())
if (a*b) % 2 == 0:
    print("Odd")
else:
    print("Even")


Fixed submission:
a, b = map(int,input().split())
if (a*b)%2 :
    print("Odd")
else:
    print("Even")
Buggy python submission (verdict: Runtime Error):
import sys
 
D = int(input())
if D == 22:
  output("Christmas Eve Eve Eve")
if D == 23:
  output("Christmas Eve Eve")
if D == 24:
  output("Christmas Eve")
if D == 25:
  output("Christmas")

Fixed submission:
import sys
 
D = int(input())
if D == 22:
  print("Christmas Eve Eve Eve")
if D == 23:
  print("Christmas Eve Eve")
if D == 24:
  print("Christmas Eve")
if D == 25:
  print("Christmas")

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

D = int(input())
if D = 22:
  output("Christmas Eve Eve Eve")
if D = 23:
  output("Christmas Eve Eve")
if D = 24:
  output("Christmas Eve")
if D = 25:
  output("Christmas")

  

Fixed submission:
import sys
 
D = int(input())
if D == 22:
  print("Christmas Eve Eve Eve")
if D == 23:
  print("Christmas Eve Eve")
if D == 24:
  print("Christmas Eve")
if D == 25:
  print("Christmas")
Buggy python submission (verdict: Runtime Error):
import numpy as np

N,K = list(map(int, input().split(",")))
h = []
for _ in range(N):
    h.append(int(input()))
h = sorted(h)
res = h[N-1] - h[0]
for i in np.arange(0,N-K+1,1):
    tmp = h[i+K-1] - h[i]
    if res > tmp:
        res = tmp
    
print(res)
    


Fixed submission:
import numpy as np

N,K = list(map(int, input().split()))
h = []
for _ in range(N):
    h.append(int(input()))
h = sorted(h)
res = h[N-1] - h[0]
for i in np.arange(0,N-K+1,1):
    tmp = h[i+K-1] - h[i]
    if res > tmp:
        res = tmp
    
print(res)
Buggy python submission (verdict: Runtime Error):
D = int(input())
print('Christmas'+'Eve'*(25 - D)

Fixed submission:
D = int(input())
print('Christmas'+' Eve'*(25 - D))
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
print(int((A-1)*(B-1)))

Fixed submission:
A,B=map(int,input().split())
print((A-1)*(B-1))

Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
print((A-1)*(B-1))

Fixed submission:
A,B=map(int,input().split())
print((A-1)*(B-1))
Buggy python submission (verdict: Runtime Error):
A=int(input())
B=int(input())
C=int(input())
D=int(input())

if A>B:
	if C>D:
		print(B+D)
	else:
		print(B+C)
else:
	if C>D:
		print(A+D)
	else:

print(A+C)

Fixed submission:

A=int(input())
B=int(input())
C=int(input())
D=int(input())

if A>B:
	if C>D:
		print(B+D)
	else:
		print(B+C)
else:
	if C>D:
		print(A+D)
	else:
		print(A+C)
Buggy python submission (verdict: Runtime Error):
'Christmas' + (25 - D) * ' Eve'

Fixed submission:
print('Christmas' + ' Eve' * (25 - int(input())))

Buggy python submission (verdict: Runtime Error):
print(D)

Fixed submission:
print('Christmas' + ' Eve' * (25 - int(input())))

Buggy python submission (verdict: Time Limit Exceeded):
D = input()
D = int(D)
while True:
    pass

if D == 25:
    print('Christmas')
elif D == 24:
    print('Christmas Eve')
elif D == 23:
    print('Christmas Eve Eve')
elif D == 22:
    print('Christmas Eve Eve Eve')


Fixed submission:
D = input()
D = int(D)
if D == 25:
    print('Christmas')
elif D == 24:
    print('Christmas Eve')
elif D == 23:
    print('Christmas Eve Eve')
elif D == 22:
    print('Christmas Eve Eve Eve')
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if product % 2 == 0:
    print('Even')
else:
    print('Odd')

Fixed submission:
import operator
import functools
number_list = list(map(int, input().split()))
product = functools.reduce(operator.mul, number_list)
if product % 2 == 0:
    print('Even')
else:
    print('Odd')
Buggy python submission (verdict: Runtime Error):
N = int(input())
x = [0] * (N + 1)
y = [0] * (N + 1)
for i in range(1, N + 1):
    t[i], x[i], y[i] = map(int, input().split())
for i in range(1, N + 1):
    if t[i] - t[i - 1] < abs(x[i] - x[i - 1]) + abs(y[i] - y[i - 1]):
        print('No')
        exit()
    elif t[i] % 2 != (x[i] + y[i]) % 2:
        print('No')
        exit()
print('Yes')

Fixed submission:
N = int(input())
t = [0] * (N + 1)
x = [0] * (N + 1)
y = [0] * (N + 1)
for i in range(1, N + 1):
    t[i], x[i], y[i] = map(int, input().split())
for i in range(1, N + 1):
    if t[i] - t[i - 1] < abs(x[i] - x[i - 1]) + abs(y[i] - y[i - 1]):
        print('No')
        exit()
    elif t[i] % 2 != (x[i] + y[i]) % 2:
        print('No')
        exit()
print('Yes')

Buggy python submission (verdict: Runtime Error):
x = [0] * (N + 1)
y = [0] * (N + 1)
for i in range(1, N + 1):
    t[i], x[i], y[i] = map(int, input().split())
for i in range(1, N + 1):
    if t[i] - t[i - 1] < abs(x[i] - x[i - 1]) + abs(y[i] - y[i - 1]):
        print('No')
        exit()
    elif t[i] % 2 != (x[i] + y[i]) % 2:
        print('No')
        exit()
print('Yes')

Fixed submission:
N = int(input())
t = [0] * (N + 1)
x = [0] * (N + 1)
y = [0] * (N + 1)
for i in range(1, N + 1):
    t[i], x[i], y[i] = map(int, input().split())
for i in range(1, N + 1):
    if t[i] - t[i - 1] < abs(x[i] - x[i - 1]) + abs(y[i] - y[i - 1]):
        print('No')
        exit()
    elif t[i] % 2 != (x[i] + y[i]) % 2:
        print('No')
        exit()
print('Yes')
Buggy python submission (verdict: Runtime Error):
kazu = int(input())
numbers_list = list(map(int, input().split()))
count = 0
seisu = 0
while True:
    for index in range(kazu):
        if numbers_list[index] % 2 != 0:
            seisu = 1
            break
        else:
            numbers_list[index] = numbers_list / 2
    if seisu == 1:
        break
    count += 1
print(count)


Fixed submission:
kazu = int(input())
numbers_list = list(map(int, input().split()))
count = 0
seisu = 0
while True:
    for index in range(kazu):
        if numbers_list[index] % 2 != 0:
            seisu = 1
            break
        else:
            numbers_list[index] = numbers_list[index] / 2
    if seisu == 1:
        break
    count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
kazu = int(input())
numbers_list = list(map(int, input().split()))
count = 0
seisu = 0
while True:
    for index in range(kazu):
        if numbers_list(index) % 2 == 0:
            numbers_list[inedx] = numbers_list[index] / 2
            count += 1
        else:
            seisu = 1
            break
    if seisu == 1:
        break
print(count)

Fixed submission:
kazu = int(input())
numbers_list = list(map(int, input().split()))
count = 0
seisu = 0
while True:
    for index in range(kazu):
        if numbers_list[index] % 2 != 0:
            seisu = 1
            break
        else:
            numbers_list[index] = numbers_list[index] / 2
    if seisu == 1:
        break
    count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
print("22から25までの数値を入力して下さい")
D = int(input())

if D == 22:
    print("Christmas Eve Eve Eve")
    break
elif D == 23:
    print("Christmas Eve Eve")
    break
elif D == 24:
    print("Christmas Eve")
    break
elif D == 25:
    print("Christmas")
    break
else:
    print("22から25までの数値を入力して下さい")
    D = int(input())

Fixed submission:
def christmasday():
    D = int(input())
    if D == 22:
        print("Christmas Eve Eve Eve")
    elif D == 23:
        print("Christmas Eve Eve")
    elif D == 24:
        print("Christmas Eve")
    elif D == 25:
        print("Christmas")
christmasday()

Buggy python submission (verdict: Runtime Error):
def christmasday():
    print("22から25までの数値を入力して下さい")
    number = int(input())

    if number == 22:
        print("Christmas Eve Eve Eve")
        break
    elif number == 23:
        print("Christmas Eve Eve")
        break
    elif number == 24:
        print("Christmas Eve")
        break
    elif number == 25:
        print("Christmas")
        break
    else:
        print("22から25までの数値を入力して下さい")
        number = int(input())
christmasday()


Fixed submission:
def christmasday():
    D = int(input())
    if D == 22:
        print("Christmas Eve Eve Eve")
    elif D == 23:
        print("Christmas Eve Eve")
    elif D == 24:
        print("Christmas Eve")
    elif D == 25:
        print("Christmas")
christmasday()