Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import math

n = int(input())
s = input()

num = []
for i in range(n-2):
  for j in range(i + 1, n-1):
    for k in range(j + 1, n):
      tmp = s[i] + s[j] + s[k]
      if tmp not in num:
      	num.append(tmp)
print(len(num))

Fixed submission:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if m1 ==1 and d1 == 31:
  print('1')
elif m1==2 and d1 == 28:
  print('1')
elif m1==3 and d1 == 31:
  print('1')
elif m1==4 and d1 == 30:
  print('1')
elif m1==5 and d1 == 31:
  print('1')
elif m1==6 and d1 == 30:
  print('1')
elif m1==7 and d1 == 31:
  print('1')
elif m1==8 and d1 == 31:
  print('1')
elif m1==9 and d1 == 30:
  print('1')
elif m1==10 and d1 == 31:
  print('1')
elif m1==11 and d1 == 30:
  print('1')
else:
  print('0')

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

x = int(input())

n = x // 105
for i in range(1, 1000):
  ave = x // i
  if 100 <= ave <= 105:
    if x % 105 >= 5*n:
      print('1')
    else:
      print('0')
    exit()
print('0')

Fixed submission:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if m1 ==1 and d1 == 31:
  print('1')
elif m1==2 and d1 == 28:
  print('1')
elif m1==3 and d1 == 31:
  print('1')
elif m1==4 and d1 == 30:
  print('1')
elif m1==5 and d1 == 31:
  print('1')
elif m1==6 and d1 == 30:
  print('1')
elif m1==7 and d1 == 31:
  print('1')
elif m1==8 and d1 == 31:
  print('1')
elif m1==9 and d1 == 30:
  print('1')
elif m1==10 and d1 == 31:
  print('1')
elif m1==11 and d1 == 30:
  print('1')
else:
  print('0')

Buggy python submission (verdict: Runtime Error):
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if m1, d1 = 1,31:
  print('1')
elif m1, d1 = 2, 28:
  print('1')
elif m1, d1 = 3, 31:
  print('1')
elif m1, d1 = 4, 30:
  print('1')
elif m1, d1 = 5, 31:
  print('1')
elif m1, d1 = 6, 30:
  print('1')
elif m1, d1 = 7, 31:
  print('1')
elif m1, d1 = 8, 31:
  print('1')
elif m1, d1 = 9, 30:
  print('1')
elif m1, d1 = 10, 31:
  print('1')
elif m1, d1 = 11, 30:
  print('1')
else:
  print('0')

Fixed submission:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if m1 ==1 and d1 == 31:
  print('1')
elif m1==2 and d1 == 28:
  print('1')
elif m1==3 and d1 == 31:
  print('1')
elif m1==4 and d1 == 30:
  print('1')
elif m1==5 and d1 == 31:
  print('1')
elif m1==6 and d1 == 30:
  print('1')
elif m1==7 and d1 == 31:
  print('1')
elif m1==8 and d1 == 31:
  print('1')
elif m1==9 and d1 == 30:
  print('1')
elif m1==10 and d1 == 31:
  print('1')
elif m1==11 and d1 == 30:
  print('1')
else:
  print('0')
Buggy python submission (verdict: Runtime Error):
s = input()
f = False
for i in s:
    if i == '7':
        f = True
	break

if f:
    print('Yes')
else:
    print('No')

Fixed submission:
s = input()
f = False
for i in s:
    if i == '7':
        f = True
        break

if f:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
import math
import itertools
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def gcd_list(numbers):
    return reduce(math.gcd, numbers)

k = int(input())
l = list(itertools.product(range(k+1)[1:], repeat=3))
s = 0

for i in l:
    s += gcd(i[0], i[1], i[2])

print(s)

Fixed submission:
import math
import itertools
from functools import reduce

def gcd_list(numbers):
    return reduce(math.gcd, numbers)

k = int(input())
l = list(itertools.combinations_with_replacement(range(k+1)[1:], 3))
s = 0
n = 0

for i in l:
    x = len(set(i))
    if x == 3:
        n = 6
    elif x == 2:
        n = 3
    elif x == 1:
        n = 1

    s += gcd_list(list(i)) * n


print(s)
Buggy python submission (verdict: Time Limit Exceeded):
d = input()
s = input()
 
r = s.count('R')
g = s.count('G')
b = s.count('B')
 
res = r*g*b
for i in range(len(s)-2):
    for j in range(i,len(s)-1):
        for k in range(j, len(s)):
            if (j - i) == (k - j):
                if s[i] != s[k] and s[i] != s[j] and s[j] != s[k]:
                    res -= 1
print(res)

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

r = s.count('R')
g = s.count('G')
b = s.count('B')

res = r*g*b
for i in range(len(s)-2):
    for j in range(i,len(s)-1):
        k = 2 * j - i
        if k < len(s) and s[i] != s[k] and s[i] != s[j] and s[j] != s[k]:
            res -= 1
print(res)

Buggy python submission (verdict: Time Limit Exceeded):
d = input()
s = input()

r = s.count('R')
g = s.count('G')
b = s.count('B')

res = r*g*b
for i in range(len(s)-2):
    for j in range(i,len(s)-1):
        k = 2 * j - i
        if k < len(s) and s[i] != s[k] and s[i] != s[j] and s[j] != s[k]:
            res -= 1
print(res)


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

r = s.count('R')
g = s.count('G')
b = s.count('B')

res = r*g*b
for i in range(len(s)-2):
    for j in range(i,len(s)-1):
        k = 2 * j - i
        if k < len(s) and s[i] != s[k] and s[i] != s[j] and s[j] != s[k]:
            res -= 1
print(res)

Buggy python submission (verdict: Time Limit Exceeded):
d = input()
s = input()

r = s.count('R')
g = s.count('G')
b = s.count('B')

res = r*g*b
for i in range(len(s)-2):
    for j in range(i,len(s)-1):
        for k in range(j, len(s)):
            if (j - i) == (k - j):
                if s[i] != s[k] and s[i] != s[j] and s[j] != s[k]:
                    res -= 1
print(res)

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

r = s.count('R')
g = s.count('G')
b = s.count('B')

res = r*g*b
for i in range(len(s)-2):
    for j in range(i,len(s)-1):
        k = 2 * j - i
        if k < len(s) and s[i] != s[k] and s[i] != s[j] and s[j] != s[k]:
            res -= 1
print(res)
Buggy python submission (verdict: Runtime Error):
import math

a,b,c = map(int,input().split())
if a + b + c == 10 and a == b:
  print("Yes")
if math.sqrt(a * b) < (c - a - b) / 2:
  print("Yes")
else:
  print("No")

Fixed submission:
l = [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(l[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()))
minimum = a[0]+b[0]

for k in range(M):
    x,y,c = map(int,input().split())
    tmp = a[x-1]+b[y-1]-c
    if minimum > tmp:
        minimum = tmp

a.sort()
b.sort()

for i in a:
    if i + b[0] > minimum:
        break
    for j in b:
        tmp = i + j
        if minimum > tmp:
            minimum = tmp
        else:
            break

print(minimum)

Fixed submission:
s=input()
res=""
if s in	("hi", "hihi", "hihihi", "hihihihi", "hihihihihi"):
  res="Yes"
else:
  res="No"
print(res)
Buggy python submission (verdict: Runtime Error):
N, K = map(input().split())

if N % K > 1:
    print(1)
else:
    print(0)

    

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

if N % K >= 1:
    print(1)
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
a,b = map(int, input())


if a % 2 ==0 and b % 2 == 0:
    print("Even")
else:
    print("Odd")

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


if a % 2 ==0 or b % 2 == 0:
    print("Even")
else:
    print("Odd")
Buggy python submission (verdict: Runtime Error):
x=input()
a=[0]
d={}
for i in range(1,1000):
	a+=[i**5]
	a+=[-i**5]
	d[i**5]=i
	d[-i**5]=-i

a.sort()
for i in range(len(a)):
    if x+a[i] in a:
        print d[a[i]+x],d[a[i]]
        break

Fixed submission:
x=input()
a=[0]
d={}
d[0]=0
for i in range(1,1000):
	a+=[i**5]
	a+=[-i**5]
	d[i**5]=i
	d[-i**5]=-i

a.sort()
for i in range(len(a)):
    if x+a[i] in a:
        print d[a[i]+x],d[a[i]]
        break
Buggy python submission (verdict: Runtime Error):
s=raw_input()
if s[3]==s[4] and s[5]==s[6]:
	print "Yes"
else:
	print "No"

Fixed submission:
s=raw_input()
if s[2]==s[3] and s[5]==s[4]:
	print "Yes"
else:
	print "No"
Buggy python submission (verdict: Runtime Error):
import math

X = int(input())

for i in range(1001):
    if ((X + i ** 5) ** 0.2).is_integer():
        print(int((X + i ** 5) ** 0.2), i)
        exit()

for j in range(1, 1001):
    if ((X - j ** 5) ** 0.2).is_integer():
        print(int((X - j ** 5) ** 0.2), -j)
        exit()


Fixed submission:
import math

X = int(input())

for i in range(1001):
    f = round((X + i ** 5) ** 0.2)
    if f ** 5 - i ** 5 == X:
        print(int((X + i ** 5) ** 0.2), i)
        exit()

for i in range(1, 1001):
    f = round(abs(X - i ** 5) ** 0.2)
    if X - i ** 5 > 0:
        if f ** 5 - (-i) ** 5 == X:
            print(f, -i)
            exit()
    else:
        if (-f) ** 5 - (-i) ** 5 == X:
            print(-f, -i)
            exit()
Buggy python submission (verdict: Time Limit Exceeded):
S = input()
Q = int(input())
rev = 0

for i in range(Q):
    l = str(input())
    if l[0] == '1':
        rev = (rev + 1) % 2
    else:
        two, F, C = l.split()
        if rev == 0:
            if F == '1':
                S = ''.join([C, S])
            else:
                S = ''.join([S, C])
        else:
            if F == '1':
                S = ''.join([S, C])
            else:
                S = ''.join([C, S])



if rev == 0:
    print(S)
else:
    print(''.join(list(reversed(S))))


Fixed submission:
from collections import deque

S = deque(input())
Q = int(input())
rev = 0

for i in range(Q):
    l = str(input())
    if l[0] == '1':
        rev = (rev + 1) % 2
    else:
        two, F, C = l.split()
        if rev == 0:
            if F == '1':
                S.appendleft(C)
            else:
                S.append(C)

        else:
            if F == '1':
                S.append(C)

            else:
                S.appendleft(C)

if rev == 0:
    print(''.join(S))
else:
    print(''.join(list(reversed(S))))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
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]:
                break
            ans += 1
print(ans)


Fixed submission:
import bisect
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N - 2):
    for j in range(i + 1, N - 1):
        index = bisect.bisect_left(L, L[i] + L[j])
        ans += max(0, index - j - 1)
print(ans)
Buggy python submission (verdict: Runtime Error):
N = input()
print(N ** 3)

Fixed submission:
N = int(input())
print(N ** 3)

Buggy python submission (verdict: Runtime Error):
print(N ** 3)

Fixed submission:
N = int(input())
print(N ** 3)
Buggy python submission (verdict: Runtime Error):
N = input()
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
ans = B[A[0]]
for i in range(1, len(A)):
  ans += B[A[i]]
  if A[i - 1] == A[i] - 1:
    ans += C[A[i - 1]]
print(ans)


Fixed submission:
N = input()
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = B[A[0] - 1]
for i in range(1, len(A)):
    ans += B[A[i] - 1]
    if A[i - 1] == A[i] - 1:
        ans += C[A[i - 1] - 1]
print(ans)

Buggy python submission (verdict: Runtime Error):
N = input()
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
ans = B[A[0]]
for i in range(1, len(A)):
  ans += B[A[i]]
  if A[i - 1] = A[i] - 1:
    ans += C[A[i - 1]]
print(ans)

Fixed submission:
N = input()
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = B[A[0] - 1]
for i in range(1, len(A)):
    ans += B[A[i] - 1]
    if A[i - 1] == A[i] - 1:
        ans += C[A[i - 1] - 1]
print(ans)
Buggy python submission (verdict: Runtime Error):
from fractions import gcd


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


A, B, C, D = map(int, input().split())
SUM = B - A + 1
c = (B // C - (A - 1) // C)
d = (B // D - (A - 1) // D)
cd = (B // lcm(C, D) - (A - 1) // lcm(C, D))
print(B - A + 1 - (B // C - (A - 1) // C + B // D - (A - 1) // D - cd)))


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, C, D = map(int, input().split())
c = B // C - (A - 1) // C
d = B // D - (A - 1) // D
c_d = B // lcm(C, D) - (A - 1) // lcm(C, D)
print(B - A + 1 - c - d + c_d)

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


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


A, B, C, D = map(int, input().split())
print(B - A + 1 - (B // C - (A - 1) // C + B // D - (A - 1) // D - (B // (lcm(C, D) - (A - 1) // lcm(C, D)))))


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, C, D = map(int, input().split())
c = B // C - (A - 1) // C
d = B // D - (A - 1) // D
c_d = B // lcm(C, D) - (A - 1) // lcm(C, D)
print(B - A + 1 - c - d + c_d)
Buggy python submission (verdict: Time Limit Exceeded):
R, G, B, N = map(int, input().split())
ans = 0
for r in range(3001):
    if R * r > N:
        break
    for g in range(3001):
        if R * r + G * g > N:
            break
        elif (N - (R * r + G * g)) % B == 0:
            ans += 1
print(ans)


Fixed submission:
R, G, B, N = map(int, input().split())
ans = 0
for r in range(N // R + 1):
    for g in range((N - R * r) // G + 1):
        if (N - (R * r + G * g)) % B == 0:
            ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = list(input())
c = 0
a = 0
cw = [0] * N
cb = [0] * N
tw = 0
tb = 0
for i in range(N):
    if S[i] == '.':
        tw += 1
        cw[i] = tw
        cb[i] = tb
    else:
        tb += 1
        cb[i] = tb
        cw[i] = tw
A = cw[N]
for i in range(N):
    A = min(A, cb[i] + cw[N - 1] - cw[i])
print(A)


Fixed submission:
N = int(input())
S = list(input())
c = 0
a = 0
cw = [0] * N
cb = [0] * N
tw = 0
tb = 0
for i in range(N):
    if S[i] == '.':
        tw += 1
        cw[i] = tw
        cb[i] = tb
    else:
        tb += 1
        cb[i] = tb
        cw[i] = tw
A = cw[i]
for i in range(N):
    A = min(A, cb[i] + cw[N - 1] - cw[i])
print(A)
Buggy python submission (verdict: Time Limit Exceeded):
N, M=map(int, input().split())
A,B=[],[]
A_t,B_t=0,0
s = 0
r = 0
for i in range(N):
    A_t, B_t = map(int,input().split())
    A.append(A_t)
    B.append(B_t)
#自力でsort関数を作ればいいのでは？
for i in range(N-1):
    for j in range(N-i-1):
        if A[j] > A[j+1]:
            A[j], A[j+1] = A[j+1], A[j]
            B[j], B[j + 1] = B[j + 1], B[j]
for j in range(N):
    if M == 0:
        break
    elif M < B[j]:
        s += A[j] * M
        #print(B[j],M)
        break
    else:
        s += A[j] * B[j]
        M -= B[j]
        #print(s,M,A[j],B[j])
print(s)


Fixed submission:
N, M = map(int,input().split())
A = []
B = []
ta = 0
tb = 0
# for i in range(N):
#     ta, tb = map(int, input().split())
#     A.append(ta)
#     B.append(tb)
# print(A,B)
L = [list(map(int,input().split())) for i in range(N)]
#print(L)
L.sort(key=lambda x: x[0])
#print(L)
c = 0
for i in range(N):
    if M <= L[i][1]:
        print(c + L[i][0] * M)
        exit()
    else:
        M -= L[i][1]
        c += L[i][0] * L[i][1]
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
a,c=[],[]
for i in range(m):
  c.append(i+1)
i=0
while i<n:
  k,a=input().split()
  for j in range(len(c)):
    if c[j] not in a:#なかったら
      c.remove(c[j])
      j-=1
    j +=1
  a=[]
print(len(c))

Fixed submission:
n, m = map(int, input().split())
a, c = [], []
for i in range(m):
    c.append(i+1)
i = 0
while i < n:
    a = list(map(int, input().split()))[1:]
    for j in range(len(c)):
        if c[j] not in a:
            c[j] = 0
    i += 1
    a = []
print(len(c)-c.count(0))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
m = 1
c = 0
for i in range(1, int(min(A))+1):
    c = 1
    for j in range(N):
        if A[j] % i != 0:
            c = 0
            break
    if c == 1:
        m = max(i, m)
print(m)


Fixed submission:
def gcd(a, b):
    if b == 0:
        return a
    else:
        return gcd(b, a % b)
N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
a = A[0]
for i in range(1,N):
    a = gcd(a,A[i])
print(a)
Buggy python submission (verdict: Runtime Error):
import math
from functools import reduce


def gcd(*numbers):
    return reduce(math.gcd, numbers)


def gcd_list(numbers):
    return reduce(math.gcd, numbers)


N, X = map(int, input().split())
x = list(map(int, input().split()))
dif = [abs(X - x[0])]

if N > 1:
    for i in range(N - 1):
        dif.append(x[i + 1] - x[i])
print(gcd_list(dif))


Fixed submission:
def gcd(a,b):
    if b == 0:
        return a
    return gcd(b, a % b)


n, X = map(int,input().split())
x = list(map(int,input().split()))
x.append(X)
x.sort()
x = [x[i]-x[0] for i in range(n+1)]
del x[0]
g = x[0]
for i in range(1, n):
    g = gcd(g,x[i])
print(g)
Buggy python submission (verdict: Runtime Error):
N, K =map(int,input().split())
x = list(map(int,input().split()))
a = 0
for i in range(100000):
    if x[i] >= 0:
        a = i
        break
s = x[a+K-1]
#print(K,s)
if a == 0:
    print(s)
else:
    for i in range(1, K):
        s = min(s,x[a+K-1-i]-x[a-i]+min(x[a+K-1-i],-x[a-i]))
    print(s)


Fixed submission:
N, K = map(int, input().split())
x = list(map(int, input().split()))
m = float("INF")
for i in range(N - K + 1):
    if x[i + K - 1] * x[i] < 0:
        m = min(m, x[i + K - 1] - x[i] + min(abs(x[i + K - 1]), abs(x[i])))
    else:
        m = min(m, max(abs(x[i + K - 1]), abs(x[i])))
print(m)
Buggy python submission (verdict: Runtime Error):
n, k = map(int, input())
if n % k == 0:
    print("0")
else:
    print("1")

Fixed submission:
n, k = map(int, input().split())
if n % k == 0:
    print("0")
else:
    print("1")
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input())
if a <= 8 and b <= 8:
    print("Yay!")
else:
    print(":(")
    

Fixed submission:
a, b = map(int, input().split())
if a <= 8 and b <= 8:
    print("Yay!")
else:
    print(":(")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()
M = 3 * 10 ** 5
#print(M)
for i in range(N-1):
    A = S[:i]
    B = S[i+1:]
#    print(A,B,A.count("W")+B.count("E"))
    M = min(M, A.count("W")+B.count("E"))
print(M)


Fixed submission:
N = int(input())
S = input()
a = S.count("E")
c = 0
A = N
for i in range(N):
    a += c
    c = 0
    if S[i] == "E":
        a -= 1
    else:
        c = 1
    A = min(A, a)
print(A)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
A = max(a)
t = -1
tt = 0
for i in range(n):
    if t < a[i]:
        t = a[i]
        tt = i
a.pop(tt)
x = 0
y = A
z = 0
for i in range(1, A):
    x += 1
    y -= 1
    if x >= y:
        z = A - x
        break
d = float('INF')
da = 0
for i in range(n - 1):
    if d > abs(a[i] - z):
        da = a[i]
        d = da - z
print(A, da)


Fixed submission:
n = int(input())
a = list(map(int, input().split()))
A = max(a)
t = -1
tt = 0
for i in range(n):
    if t < a[i]:
        t = a[i]
        tt = i
a.pop(tt)
# print(a)
z = A / 2
d = float('INF')
da = 0
for i in range(n - 1):
    # print(d, abs(a[i] - z))
    if d > abs(a[i] - z):
        da = a[i]
        d = abs(da - z)
print(A, da)
Buggy python submission (verdict: Runtime Error):
a,b =input（）.split（）
c=int（a+b）
i=1
while True:
  if i *i ==c:
    print（"Yes"）
    exit（）
  elif i*i >c:
    print（"No"）
    exit（）
  else:
    i += 1
a,b = list（input（）.split（））
c=int（a+b）
i=1
while True:
  if i *i ==c:
    print（"Yes"）
    exit（）
  elif i*i >c:
    print（"No"）
    exit（）
  else:
    i += 1


Fixed submission:
A,B=input().split()
A=int(A)
B=int(B)
if A*B%2==0 :
  print("Even")
else :
  print("Odd")

Buggy python submission (verdict: Runtime Error):
a,b =input（）.split（）
c=int（a+b）
i=1
while True:
  if i *i ==c:
    print（"Yes"）
    exit（）
  elif i*i >c:
    print（"No"）
    exit（）
  else:
    i += 1
a,b = list（input（）.split（））
c=int（a+b）
i=1
while True:
  if i *i ==c:
    print（"Yes"）
    exit（）
  elif i*i >c:
    print（"No"）
    exit（）
  else:
    i += 1

Fixed submission:
A,B=input().split()
A=int(A)
B=int(B)
if A*B%2==0 :
  print("Even")
else :
  print("Odd")

Buggy python submission (verdict: Runtime Error):
A,B=input().split()
A=int(A)
B=int(B)
if A*B%2==0 :
  print("Even")
  else :
    print("odd")

Fixed submission:
A,B=input().split()
A=int(A)
B=int(B)
if A*B%2==0 :
  print("Even")
else :
  print("Odd")

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

Fixed submission:
A,B=input().split()
A=int(A)
B=int(B)
if A*B%2==0 :
  print("Even")
else :
  print("Odd")

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

Fixed submission:
A,B=input().split()
A=int(A)
B=int(B)
if A*B%2==0 :
  print("Even")
else :
  print("Odd")

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

Fixed submission:
A,B=input().split()
A=int(A)
B=int(B)
if A*B%2==0 :
  print("Even")
else :
  print("Odd")
Buggy python submission (verdict: Runtime Error):
a,b =input（）.split（）
c=int（a+b）
i=1
while True:
  if i *i ==c:
    print（"Yes"）
    exit（）
  elif i*i >c:
    print（"No"）
    exit（）
  else:
    i += 1
a,b = list（input（）.split（））
c=int（a+b）
i=1
while True:
  if i *i ==c:
    print（"Yes"）
    exit（）
  elif i*i >c:
    print（"No"）
    exit（）
  else:
    i += 1


Fixed submission:
a,b = list(input().split())
c=int(a+b)
i=1
while True:
  if i *i ==c:
    print("Yes")
    exit()
  elif i*i >c:
    print("No")
    exit()
  else:
    i += 1
a,b = list(input().split())
c=int(a+b)
i=1
while True:
  if i *i ==c:
    print("Yes")
    exit()
  elif i*i >c:
    print("No")
    exit()
  else:
    i += 1

Buggy python submission (verdict: Runtime Error):
a,b = list（input（）.split（））
c=int（a+b）
i=1
while True:
  if i *i ==c:
    print（"Yes"）
    exit（）
  elif i*i >c:
    print（"No"）
    exit（）
  else:
    i += 1

Fixed submission:
a,b = list(input().split())
c=int(a+b)
i=1
while True:
  if i *i ==c:
    print("Yes")
    exit()
  elif i*i >c:
    print("No")
    exit()
  else:
    i += 1
a,b = list(input().split())
c=int(a+b)
i=1
while True:
  if i *i ==c:
    print("Yes")
    exit()
  elif i*i >c:
    print("No")
    exit()
  else:
    i += 1
Buggy python submission (verdict: Runtime Error):
y,m,d=list(input().split())
y=2018
print(y+"/"+m+"/"+d)


Fixed submission:
y,m,d=input().split("/")
y=str(2018)
print(y+"/"+m+"/"+d)

Buggy python submission (verdict: Runtime Error):
y,m,d=input().split()
y=2018
print(y+"/"+m+"/"+d)

Fixed submission:
y,m,d=input().split("/")
y=str(2018)
print(y+"/"+m+"/"+d)

Buggy python submission (verdict: Runtime Error):
N = int(input())
d = []
for i in range(N):
    d.append(int(input()))
print(len(set(d)))

Fixed submission:
y,m,d=input().split("/")
y=str(2018)
print(y+"/"+m+"/"+d)
Buggy python submission (verdict: Time Limit Exceeded):
N, Y = list(map(int, input().split()))
c = 0
for i in range(N+1):
    for j in range(N-i+1):
        for k in range(N-i-j+1):
            #print(i,j,k)
            if 10000 * i + 5000 * j + 1000 * k == Y and i + j + k == N:
                print(i, j, k)
                c = 1
                break
        if c == 1:
            break
    if c == 1:
        break
if c == 0:
    print(-1,-1,-1)

Fixed submission:
N, Y = list(map(int, input().split()))
c = 0
for i in range(N+1):
    for j in range(N-i+1):
        if 10000 * i + 5000 * j + 1000 * (N-i-j) == Y:
            print(i, j, (N-i-j))
            c = 1
            break
    if c == 1:
        break
if c == 0:
    print(-1, -1, -1)