Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p03854 (python)

Fixed submission:
s = input()

ichi = 0
l = len(s)
cnt = l

while True:
    s_dreamer = s.rfind ("dreamer",ichi,l)
    s_eraser = s.rfind ("eraser",ichi,l)
    s_dream = s.rfind ("dream",ichi,l)
    s_erase = s.rfind ("erase",ichi,l)

    if s_dreamer == l - 7 and 0 <= l - 7:
        l = s_dreamer
        cnt -= 7 

    elif s_eraser == l - 6 and 0 <= l - 6:
        l = s_eraser
        cnt -= 6  

    elif s_dream == l - 5 and 0 <= l - 5:
        l = s_dream
        cnt -= 5  

    elif s_erase == l - 5 and 0 <= l - 5:
        l = s_erase
        cnt -= 5

    elif cnt == 0:
        print("YES")
        break

    else:
        print("NO")
        break

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

ichi = 0
cnt = 0
l = len(s)

while True:
    s_dreamer = s.find ("dreamer",ichi,l)
    s_eraser = s.find ("eraser",ichi,l)
    s_dream = s.find ("dream",ichi,l)
    s_erase = s.find ("erase",ichi,l)


    if s_dream == ichi:
        ichi = s_dreamer + 7
        cnt += 7 

    elif s_eras == ichi:
        ichi = s_eraser + 6
        cnt += 6  

    elif s_dreamer == ichi:
        ichi = s_dream + 5
        cnt += 5  

    elif s_eraser == ichi:
        ichi = s_erase + 5
        cnt += 5

    elif cnt == l:
        print("YES")
        break

    else:
        print("NO")
        break
Problem p03292 (python)

Fixed submission:
a = input().split()
b =[]
for i in a:
    b.append(int(i))
b.sort()

print(b[-1] - b[0])

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

a.sort()

print(a[-1] - a[0])
Problem p03206 (python)

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

Buggy submission (verdict: Runtime Error):
a = int(input())
d = {
    25 : 'Christmas',
    24 : 'Christmas Eve Eve',
    23 : 'Christmas Eve Eve Eve'
}
print(d[a])
Problem p03239 (python)

Fixed submission:
N, T = list(map(int, input().split()))
pairs = []
for i in range(N):
  c, t = list(map(int, input().split()))
  if t<=T:
    pairs.append((c, t))
if len(pairs)==0:
  print('TLE')
else:
  print(sorted(pairs, key=lambda p:p[0])[0][0])

Buggy submission (verdict: Runtime Error):
N, T = list(map(int, input().split()))
paris = []
for i in range(N):
  c, t = list(map(int, input().split()))
  if t<=T:
    pairs.append((c, t))
if len(pairs)==0:
  print('TLE')
else:
  print(sorted(pairs, key=lambda p:p[0])[0][0])
Problem p03241 (python)

Fixed submission:
N, M = list(map(int, input().split(" ")))
def solv(N, M):
    d = M//N
    for i in range(d+1)[::-1]:
        if M%i == 0:
            return i
print(solv(N, M))

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

ds = [x for x in range(1, m**.5+1) if m%x==0]
ds = ds + [m%x for x in ds]
ds = [x for x in ds if x<=m//n]
print(max(ds))
Problem p03251 (python)

Fixed submission:
n, m, x, y = list(map(int, input().split()))
xs = list(map(int, input().split()))
ys = list(map(int, input().split()))

xs_max = max(xs)
ys_min = min(ys)
#print(xs_max, ys_min)
flag = True
for xi in range(xs_max+1, ys_min+1):
  #print(xi)
  if x<xi and xi<=y:
    print('No War')
    flag = False
    break
if flag:
  print('War')

Buggy submission (verdict: Runtime Error):
n, m, x, y = list(map(int, input().split()))
xs = list(map(int, input().split()))
ys = list(map(int, input().split()))

xs_max = max(xs)
ys_min = min(ys)
flag = True
for xi in range(xs+1, ys_min):
  if x<xi and xi<=y:
    print('No War')
    flag = False
    break
if flag:
  print('War')
Problem p03244 (python)

Fixed submission:
from collections import Counter

n = int(input())
v = [int(i) for i in input().split()]
v1 = Counter(v[::2])
v2 = Counter(v[1::2])
v1mc = v1.most_common()
v2mc = v2.most_common()
if(v1mc[0][0] == v2mc[0][0]):
    if(len(v1mc) == 1 and len(v2mc) == 1):
        print(int(n/2))
    elif(len(v1mc) == 1):
        print(n - (v1mc[0][1]+v2mc[1][1]))
    elif(len(v2mc) == 1):
        print(n - (v2mc[0][1]+v1mc[1][1]))
    else:
        print(n - max(v1mc[0][1]+v2mc[1][1], v2mc[0][1]+v1mc[1][1]))
else:
    print(n - (v1mc[0][1]+v2mc[0][1]))

Buggy submission (verdict: Runtime Error):
from collections import Counter

n = int(input())
if(n == 2):
    print(0)
else:
    n2 = n/2
    v = [int(i) for i in input().split()]
    v1 = Counter(v[::2])
    v2 = Counter(v[1::2])
    v1mc = v1.most_common()
    v2mc = v2.most_common()
    if(v1mc[0][0] == v2mc[0][0]):
        print(n - max(v1mc[0][1]+v2mc[1][1], v2mc[0][1]+v1mc[1][1]))
    else:
        print(n - (v1mc[0][1]+v2mc[0][1]))

Buggy submission (verdict: Runtime Error):
n = int(input())
n2 = n/2
v = [int(i) for i in input().split()]
v1 = []
v2 = []
for i in range(n):
    if(i % 2 == 0):
        v1.append(v[i])
    else:
        v2.append(v[i])
count1 = [v1.count(v1[i]) for i in range(int(n2))]
count2 = [v2.count(v2[i]) for i in range(int(n2))]
if(v1[count1.index(max(count1))] == v2[count2.index(max(count2))]):
    max1 = max(count1)
    max2 = max(count2)
    count1 = list(set(count1))
    count1.remove(max(count1))
    count2 = list(set(count2))
    count2.remove(max(count2))
    if(max(count1) > max(count2)):
        print(n - max(count1) - max2)
    else:
        print(n - max(count2) - max1)
else:
    print(n - max1 - max2)

Buggy submission (verdict: Runtime Error):
n = int(input())
n2 = n/2
v = [int(i) for i in input().split()]
v1 = []
v2 = []
for i in range(n):
    if(i % 2 == 1):
        v2.append(v[i])
    else:
        v1.append(v[i])
count1 = [v1.count(v1[i]) for i in range(int(n2))]
count2 = [v2.count(v2[i]) for i in range(int(n2))]
if(v1[count1.index(max(count1))] == v2[count2.index(max(count2))]):
    count2 = list(set(count2))
    count2.sort()
    print(int(n - max(count1) - count2[1]))
else:
    print(int(n - max(count1) - max(count2)))

Buggy submission (verdict: Runtime Error):
n = int(input())
v = [int(i) for i in input().split()]
v1 = []
v2 = []
for i in range(n):
    if(i % 2 == 1):
        v1.append(v[i])
    else:
        v2.append(v[i])
count1 = [v1.count(v1[i]) for i in range(int(n/2))]
count1 = list(set(count1))
count1.sort()
count2 = [v2.count(v2[i]) for i in range(int(n/2))]
count2 = list(set(count2))
count2.sort()
if(count1[0] == count2[0]):
    print(int(n/2 - count1[0] + n/2 - count2[1]))
else:
    print(int(n/2 - count1[0] + n/2 - count2[0]))
Problem p03711 (python)

Fixed submission:
listA = [1, 3, 5, 7, 8, 10, 12]
listB = [4, 6, 9, 11]
listC = [2]
a = {}
b = {}
c = {}

N = [int(i) for i in input().split()]

for i in range(2):
	a[i] = N[i] in listA
	b[i] = N[i] in listB
	c[i] = N[i] in listC


if a[0] == True and a[1] == True:
	print ("Yes")
elif b[0] == True and b[1] == True:
	print ("Yes")
elif c[0] == True and c[1] == True:
	print ("Yes")
else:
	print ("No")

Buggy submission (verdict: Runtime Error):
H, W = (int(i) for i in input().split())
str = [input() for i in range(H)]
print(str)

for i in range(W+2):
        print("#", end = "")
print("")

for i in range(H):
        print("#", end = "")
        print(str[i], end = "")
        print("#")

for i in range(W+2):
        print("#", end = "")
print("")

Buggy submission (verdict: Runtime Error):
listA = [1, 3, 5, 7, 8, 10, 12]
listB = [4, 6, 9, 11]
listC = [2]

N = [int(i) for i in input().split()]

for i in range(2):
	a[i] = N[i] in listA
	b[i] = N[i] in listB
	c[i] = N[i] in listC

if a[0] == a[1]:
	print "yes"
elif b[0] == b[1]:
	print "yes"
elif c[0] == c[1]:
	print "yes"
else:
	print "no"
Problem p03627 (python)

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

bars.sort(reverse=True)

flag = 0
l = 0
l1 = 0
l2 = 0

for x in bars:
    if flag==0:
        l = x
        flag = 1
    elif flag==1 and x==l and l1==0:
        l1 = x
        l = 0
        flag = 0
    elif flag==1 and x==l and l1!=0:
        l2 = x
        break
    else:
        l = x
        flag = 1

print(l1 * l2)

Buggy submission (verdict: Runtime Error):
N = int(input())
s1 = input()
s2 = input()
sum = 1
mul = 1
flag = 0
i = 0

while True:
    if i >= N:
        print(sum%1000000007)
        break

    elif s1[i]==s2[i] and flag==0:
        sum = 3
        i += 1
        flag = 1
    elif s1[i]!=s2[i] and flag==0:
        sum = 6
        i += 2
        flag = 2
    elif s1[i]==s2[i] and flag==1:
        mul = 2
        i += 1
        flag = 1
    elif s1[i]!=s2[i] and flag==1:
        mul = 2
        i += 2
        flag = 2
    elif s1[i]==s2[i] and flag==2:
        mul = 1
        i += 1
        flag = 1
    elif s1[i]!=s2[i] and flag==2:
        mul = 3
        i += 2
        flag = 2
    sum = sum*mul
Problem p03628 (python)

Fixed submission:
N = int(input())
s1 = input()
s2 = input()
sum = 1
mul = 1
flag = 0
i = 0

while True:
    if i >= N:
        print(sum%1000000007)
        break

    elif s1[i]==s2[i] and flag==0:
        sum = 3
        i += 1
        flag = 1
    elif s1[i]!=s2[i] and flag==0:
        sum = 6
        i += 2
        flag = 2
    elif s1[i]==s2[i] and flag==1:
        mul = 2
        i += 1
        flag = 1
    elif s1[i]!=s2[i] and flag==1:
        mul = 2
        i += 2
        flag = 2
    elif s1[i]==s2[i] and flag==2:
        mul = 1
        i += 1
        flag = 1
    elif s1[i]!=s2[i] and flag==2:
        mul = 3
        i += 2
        flag = 2
    sum = sum*mul

Buggy submission (verdict: Runtime Error):
N = int(input())
l1 = input()
l2 = input()
result_f=[3,6]
result_g=[3,6]

def f(N, l1, l2):
    if N==1:
        return 3
    if N==2:
        return 6
    else:
        if l1[len(l1)-1]==l2[len(l2)-1]:
            if l1[len(l1)-2]==l2[len(l2)-2]:
                l1 = l1[:len(l1)-3]
                l2 = l2[:len(l2)-3]
                return f(N-1, l1, l2)*2
            else:
                l1 = l1[:len(l1)-2]
                l2 = l2[:len(l2)-2]
                return g(N-1, l1, l2)
        else:
            return g(N, l1, l2)

def g(N, l1, l2):
    if N==1:
        return 3
    if N==2:
        return 6
    if N==3:
        return 6
    else:
        if l1[len(l1)-1]!=l2[len(l2)-1]:
            if l1[len(l1)-3]==l2[len(l2)-3]:
                l1 = l1[:len(l1)-3]
                l2 = l2[:len(l2)-3]
                return f(N-2, l1, l2)*2
            else:
                l1 = l1[:len(l1)-3]
                l2 = l2[:len(l2)-3]
                return g(N-2, l1, l2)*3
        else:
            return f(N, l1, l2)

print(f(N, l1, l2)%1000000007)
Problem p03697 (python)

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

if a+b<10:
  print(a+b)
else:
  print("error")

Buggy submission (verdict: Runtime Error):
a,b=map[int,input().split()]

if a+b<10:
  print(a+b)
else:
  print("error")

Buggy submission (verdict: Runtime Error):
a=int(input())
b=int(input())
c=a+b

if c<10:
  print(c)
else:
  print('error')

Buggy submission (verdict: Runtime Error):
a=int(input())

b=int(input())

if a+b<10:
  print('%d',a+b)
else:
  print('error')

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

b=input()

if a+b<10:
  print('%d',a+b)
else:
  print('error')

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

b=input()

if int(a)+int(b)<10:
  print(a+b)
else:
  print('error')

Buggy submission (verdict: Runtime Error):
a=input()
b=input()

if c>=10:
  print('error')
  
  else:
    print(a+b)

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
c=a+b

if c>=10:
  print('error')
  
  else:
    print('c')

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
c=a+b
if c>=10:
  print('error')
  
  else:
    print(c)
Problem p03719 (python)

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

if c>=a and c<=b:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input(),split())

if c>=a and b<=a:
  print("Yes")
else:
  print("No")
Problem p04047 (python)

Fixed submission:
N = int(input())

L = list(map(int, input().split()))

L.sort()

ans = 0

for i in range(N):
    ans = ans + L[i*2]
    
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())

x = list(map(int, input().split()))

x.sort()

ans = 0

for i range(n):
  ans = ans + x[i*2]
    
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())

x = list(map(int, input().split()))

x.sort()

ans = 0

for i range(n):
  ans = ans + x[i*2]
    
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())

x = list(map(int, input().split()))

x.sort()

ans = 0

for i range(n):
  ans = ans + x[i*2]
    
print(ans)

Buggy submission (verdict: Runtime Error):
n= int(input())

x= list(map(int, input().split()))

x.sort()

ans = 0

for i range(n):
  ans = ans + x[i*2]
    
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())

x=list(map(int, input().split()))

x.sort()

ans = 0

for i range(n):
  ans = ans + x[i*2]
    
print(ans)

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

x.sort()

ans = 0

for i range(n):
  ans = ans + x[i*2]
    
print(ans)

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

x.sort()

ans=0

for i range(n):
  ans = ans + x[i*2]
    
print(ans)

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

x.sort()

ans=0

for i range(n):
  ans=ans+x[i*2]
    
print(ans)

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

x.sort()
ans=0

for i range(n):
  ans=ans+x[i*2]
    
print(ans)

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

x.sort()
ans=0

for i range(n):
  ans=ans+x[i*2]
    
print(ans)

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

x.sort()
ans=0

for i range(n):
  ans=+x[i*2]
    
print(ans)

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

x.sort()
ans=0

for i range(n):
  ans+=x[i*2]
    
print(ans)

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

x.sort()
ans=0

for i range(n):
  if i%2==1:
    pass
  else:
    ans+=min(x[i],x[i+1])
    
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=[]
cou=0

for i in range(n*2):
  a[i]=int(input())
  
a.sort()
for i*2 in range(n):
  cou+=min(a[i],a[i+1])
  
print(cou)
Problem p03399 (python)

Fixed submission:
A = int(input())
B = int(input())
C = int(input())
D = int(input())

densha = min(A,B)
bus = min(C,D)

print(densha+bus)

Buggy submission (verdict: Runtime Error):
import math

A, B = map(int, input().split())

A_row = math.ceil((A-1)/50)
if A_row == 0:
    A_row = 1
A_row_full = (A-1)//50
B_row = math.ceil((B-1)/50)
if B_row == 0:
    B_row = 1
B_row_full = (B-1)//50

print("100 ", (A_row+B_row)*2)

A_mod = (A-1)%50
B_mod = (B-1)%50

if A_row == A_row_full:
    A_add = ''
else:
    A_add = '.#'

if B_row == B_row_full:
    B_add = ''
else:
    B_add = '.#'
    

for i in range(50):
    print('.#'*A_row_full + (A_add if i < A_mod else '##') + '.#'*B_row_full + (B_add if i < B_mod else '..'))
    print('##'*A_row + '..'*B_row)
Problem p03439 (python)

Fixed submission:

import math
import sys

def isBetween(i1, i2, res1, res2):
    return (i1 % 2 == i2 % 2) != (res1 == res2)

def search(s_range, isLeft, result):
    half = s_range[0] + math.floor((s_range[1] - s_range[0])/2)
    print(half)
    res = input()

    if res == 'Vacant':
        return

    if isLeft:
        if isBetween(s_range[0]-1, half, result, res):
            search((s_range[0], half-1), False, res)
        else:
            search((half+1, s_range[1]), True, res)
    else:
        if isBetween(half, s_range[1]+1, res, result):
            search((half+1, s_range[1]), True, res)
        else:
            search((s_range[0], half-1), False, res)


def main():
    N = int(input())

    print(0)
    res = input()

    s_range = (1, N-1)
    search(s_range, True, res)

main()

Buggy submission (verdict: Runtime Error):

import math

def regular(i1, i2, res1, res2):
    return ((i1 % 2 == i2 % 2) and not (res1 == res2)) or (not (i1 % 2 == i2 % 2) and (res1 == res2))

def search(range_list, result_list):

    print(range_list)
    next_range_list = []
    next_result_list = []

    for r in zip(range_list, result_list):
        rng = r[0]
        result = r[1]
        half = rng[0] + math.floor((rng[1] - rng[0])/2)

        res = input()

        if res == 'Vacant':
            return
        else:
            if rng[0] == rng[1]:
                return

            if regular(result[0], half, result[1], res):
                next_range_list.append((rng[0], half - 1))
                next_range_list.append((half + 1, rng[1]))
                next_result_list.append((half, res))
                next_result_list.append((half, res))

            else:
                search([(rng[0], half - 1)], [(half, res)])
                return


    search(next_range_list, next_result_list)

def main():
    N = int(input())

    print(0)
    res1 = input()
    half = math.floor(N/2)
    print(half)
    res2 = input()

    if res1 == 'Vacant' or res2 == 'Vacant':
        return

    range_list = []
    result_list = []

    if regular(0, half, res1, res2):
        if 1 <= half-1:
            range_list.append((1, half-1))
            result_list.append(0, res1)
        if half+1 <= N-1:
            range_list.append((half + 1, N-1))
            result_list.append(half, res2)
    else:
        if 1 <= half - 1:
            range_list = [(1, half-1)]
            result_list = [(0, res1)]
        else:
            range_list = [(half+1, N-1)]
            result_list = [(half, res2)]

    search(range_list, result_list)

main()
Problem p03316 (python)

Fixed submission:
n = input()
nl = [int(i) for i in n]
ns = sum(nl)
print(["No", "Yes"][int(n) % ns == 0])

Buggy submission (verdict: Runtime Error):
n = input()
nl = [int(i) for i in n]
ns = sum(nl)
print(["No", "Yes"][n % ns == 0])
Problem p03416 (python)

Fixed submission:
a, b = map(int, input().split())
r = 0
for i in range(a, b + 1):
  if str(i) == str(i)[::-1]:
    r += 1
print(r)

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
r = 0
for i in range(a, b + 1):
  if i == i[::-1]:
    r += 1
print(r)
Problem p03424 (python)

Fixed submission:
n = int(input())
sl = [i for i in input().split()]
print(["Three", "Four"][len(set(sl)) == 4])

Buggy submission (verdict: Runtime Error):
sl = [i for i in -input().split()]
print(["Three", "Four"][len(set(sl)) == 4])

Buggy submission (verdict: Runtime Error):
n = int(input())
sl = [i for i in input().split()]
print(["Three", "Four"][len(set(sl)) == 4]
Problem p03502 (python)

Fixed submission:
n = input()
nl = [int(i) for i in n]
nl_s = 0
for i in nl:
  nl_s += i
print("Yes" if int(n) % nl_s == 0 else "No")

Buggy submission (verdict: Runtime Error):
n = input()
nl = [int(i) for i in n]
nl_s = 0
for i in nl:
  nl_s += i
print("Yes" if n % nl_s == 0 else "No")
Problem p03698 (python)

Fixed submission:
s = [i for i in input()]
print("yes" if len(s) == len(set(s)) else "no")

Buggy submission (verdict: Runtime Error):
s = [i for i in input()]
print("yes" len(s) == len(set(s)) else "no")
Problem p03719 (python)

Fixed submission:
a, b, c = map(int, input().split())
print("Yes" if a <= c and c <= b else "No")

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
print("Yes" a <= c and c <= b else "No")
Problem p03729 (python)

Fixed submission:
a, b, c = input().split()
print("YES" if a.endswith(b[:1]) and b.endswith(c[:1]) else "NO")

Buggy submission (verdict: Runtime Error):
a, b, c = input().split()
print("YES" if a[-1] == b[1] and b[-1] == c[1] else "NO")
Problem p03796 (python)

Fixed submission:
n = int(input())
x, i = 1, 1
while i <= n:
  x = (x * i) % (10 ** 9 + 7)
  i += 1
print(x)

Buggy submission (verdict: Runtime Error):
x, i = 1, 1
while i <= int(input()):
  x = (x * i) % (10 ** 9 + 7)
  i += 1
print(x)
Problem p03997 (python)

Fixed submission:
l = [int(input()) for i in range(1, 4)]
print((l[0] + l[1]) * l[2] // 2)

Buggy submission (verdict: Runtime Error):
a, b, h = [int(input()) for i in range(4)]
print((a + b) * h // 2)
Problem p03448 (python)

Fixed submission:
def main(A, B, C, X):
    # type: (int, int, int, int) -> None
    coins = [
        (a,b,c)
        for a in range(0,A+1)
        for b in range(0,B+1)
        for c in range(0,C+1)
        if 500*a + 100*b + 50*c == X
    ] # type: List[Tuple[int, int, int]]
    print(len(coins))

if __name__ == '__main__':
    A = int(input())
    B = int(input())
    C = int(input())
    X = int(input())
    main(A,B,C,X)

Buggy submission (verdict: Runtime Error):
def main(A, B, C, X):
    # type: (int, int, int, int) -> None
    coins = [
        (a,b,c)
        for a in range(A)
        for b in range(B)
        for c in range(C)
        if 500*a + 100*b + 50*c == X
    ] # type: List[Tuple[int, int, int]]
    print(len(coins))

if __name__ == '__main__':
    A,B,C,X,*_ = list(map(int, input().split()))
    main(A,B,C,X)
Problem p03455 (python)

Fixed submission:
import sys
#from typing import *


def main(argv):
    # type: (List[str]) -> int
    a, b, *_ = map(int, argv) # type: Tuple[int, int, Any]
    if a % 2 == 0 or b % 2 == 0:
        print("Even")
    else:
        print("Odd")
    return 0

if __name__ == '__main__':
    # main(sys.argv[1:])
    main(input().split())

Buggy submission (verdict: Runtime Error):
import sys
from typing import *


def main(argv):
    # type: (List[str]) -> int
    a, b, *_ = map(int, argv) # type: Tuple[int, int, Any]
    if a % 2 == 0 or b % 2 == 0:
        print("Even")
    else:
        print("Odd")
    return 0

if __name__ == '__main__':
    # main(sys.argv[1:])
    main(input().split())