Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
S={i:input() for i in range(N)}
value=[]
max=0

for i in S.values():
	N=list(S.values()).count(i)
	if N>max or N==max:
		max=N
for j in S.values():
	M=list(S.values()).count(j)
	if N==M:
		value.append(j)
value=list(set(value))
value.sort()
[print(i) for i in value]

Fixed submission:
import sys
from collections import Counter
N = int(sys.stdin.readline())
S = sys.stdin.read().split()
 
count = Counter(S)
max_num = max(count.values())

max_list = [i for i,j in count.items() if j==max_num]
 
max_list.sort()
print('\n'.join(max_list))
Buggy python submission (verdict: Runtime Error):
N,M=map(int, input().split())

if X==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: Time Limit Exceeded):
N=int(input())
P=list(map(int, input().split()))
a=1
b=0
for i in P:
	M=min(P[:a])
	if M==i:
		b+=1
	a+=1
print(b)

Fixed submission:
_ = input()
p = list(map(int, input().split()))
m = float("inf")
c = 0
for i in p:
  c += i <= m
  m = min(m, i)
print(c)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
P=list(map(int, input().split()))
a=1
b=0
for i in P:
	M=min(P[:a])
	if M==i:
		b+=1
	a+=1
print(b)

Fixed submission:
_ = input()
p = list(map(int, input().split()))
m = float("inf")
c = 0
for i in p:
  c += i <= m
  m = min(m, i)
print(c)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
P=list(map(int, input().split()))
a=1
b=0
for i in P:
	Q=P[:a]
	M=min(Q)
	if M==i:
		b+=1
	a+=1
print(b)

Fixed submission:
_ = input()
p = list(map(int, input().split()))
m = float("inf")
c = 0
for i in p:
  c += i <= m
  m = min(m, i)
print(c)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
P=list(map(int, input().split()))
a=1
b=0
for i in P:
	Q=P[:a]
	M=min(Q)
	if M==i:
		b+=1
	a+=1
print(b)

Fixed submission:
_ = input()
p = list(map(int, input().split()))
m = float("inf")
c = 0
for i in p:
  c += i <= m
  m = min(m, i)
print(c)
Buggy python submission (verdict: Time Limit Exceeded):
A,B,K=map(int, input().split())
for i in range(K):
	if A>=1:
		A-=1
	elif B>=1:
		B-=1
print(A,B)

Fixed submission:
A,B,K=map(int, input().split())
A=A-K
if A<=0:
	B=B+A
if A<0:
	A=0
if B<0:
	B=0
print(A,B)
Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n=int(input())
l=list(map(int,input().split()))
ans=0
for i in itertools.combinations(l,3):
	a,b,c=map(int,i)
	if a<b+c and b<c+a and c<a+b:
		ans+=1
print(ans)

Fixed submission:
N=int(input())
l=list(map(int,input().split()))
l.sort()
count=0
import bisect
for i in range(N):
    for j in range(i+1,N-1):
        m=bisect.bisect_left(l,l[i]+l[j])
        count+=m-(j+1)
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n=int(input())
l=list(map(int,input().split()))
ans=0
for i in itertools.combinations(l,3):
	a,b,c=map(int,i)
	if a<b+c and b<c+a and c<a+b:
		ans+=1
print(ans)

Fixed submission:
N=int(input())
l=list(map(int,input().split()))
l.sort()
count=0
import bisect
for i in range(N):
    for j in range(i+1,N-1):
        m=bisect.bisect_left(l,l[i]+l[j])
        count+=m-(j+1)
print(count)
Buggy python submission (verdict: Runtime Error):
if input()=='Sunny':
	print('Cloudy')
elif input()=='Rainy':
	print('Sunny')
else:
	print('Rainy')

Fixed submission:
s=input()
if s=='Sunny':
	print('Cloudy')
elif s=='Rainy':
	print('Sunny')
else:
	print('Rainy')
Buggy python submission (verdict: Runtime Error):
a=

Fixed submission:
a = int(input())
s = input()
print(s if a >= 3200 else 'red')

Buggy python submission (verdict: Runtime Error):
a = int(input())
2 s = input()
3 print(s if a >= 3200 else 'red')

Fixed submission:
a = int(input())
s = input()
print(s if a >= 3200 else 'red')

Buggy python submission (verdict: Runtime Error):
a = int(input())
2 s = input()
3 print(s if a >= 3200 else 'red')

Fixed submission:
a = int(input())
s = input()
print(s if a >= 3200 else 'red')
Buggy python submission (verdict: Runtime Error):
a,b = int(input()).split()
wa = a + b
sa = a - b
seki = a * b
list = [wa,sa,seki]
print(max(list))

Fixed submission:
a,b = map(int,input().split())
wa = a + b
sa = a - b
seki = a * b
list = [wa,sa,seki]
print(max(list))

Buggy python submission (verdict: Runtime Error):
a,b = int(input().split())
wa = a + b
sa = a - b
seki = a * b
list = [wa,sa,seki]
print(max(list))

Fixed submission:
a,b = map(int,input().split())
wa = a + b
sa = a - b
seki = a * b
list = [wa,sa,seki]
print(max(list))
Buggy python submission (verdict: Runtime Error):
N = int(input())
ans = 0
for i in range(1, N + 1):
	if len(str(i)) % 2 == 1:
		ans += 1
print(ans)

Fixed submission:
a,b,c=map(int,input().split())
s=c-min(c,a-b)
print(s)

Buggy python submission (verdict: Runtime Error):
N = int(input())
ans = 0
for i in range(1, N + 1):
	if len(int(i)) % 2 == 1:
		ans += 1
print(ans)

Fixed submission:
a,b,c=map(int,input().split())
s=c-min(c,a-b)
print(s)

Buggy python submission (verdict: Runtime Error):
N = int(input())
ans = 0
for i in range(1, N + 1):
	if len(i) % 2 == 1:
		ans += 1
print(ans)

Fixed submission:
a,b,c=map(int,input().split())
s=c-min(c,a-b)
print(s)
Buggy python submission (verdict: Runtime Error):
N = int(input())
ans = 0
for i in range(1, N + 1):
if len(i) % 2 == 1:
ans += 1
print(ans)

Fixed submission:
N = int(input())
ans = 0
for i in range(1, N + 1):
	if len(str(i)) % 2 == 1:
		ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a%2 != b%2:
	print('IMPOSSIBLE')
else:
	int k=(a+b)/2
	print(k)

Fixed submission:
a,b=map(int,input().split())
if a%2 != b%2:
	print("IMPOSSIBLE")
else:
	k=(a+b)//2
	print(k)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a%2 != b%2:
  	print('IMPOSSIBLE')
else:
	k=(a+b)/2
  	print(k)

Fixed submission:
a,b=map(int,input().split())
if a%2 != b%2:
	print("IMPOSSIBLE")
else:
	k=(a+b)//2
	print(k)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a%2 != b%2 :
  	print('IMPOSSIBLE')
else:
	k=(a+b)/2
  	print(k)

Fixed submission:
a,b=map(int,input().split())
if a%2 != b%2:
	print("IMPOSSIBLE")
else:
	k=(a+b)//2
	print(k)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a%2 != b%2 :
  	print('IMPOSSIBLE')
else
	k=(a+b)/2
  	print(k)

Fixed submission:
a,b=map(int,input().split())
if a%2 != b%2:
	print("IMPOSSIBLE")
else:
	k=(a+b)//2
	print(k)
Buggy python submission (verdict: Runtime Error):
import math
n,d=map(int,input().split())
print(math.ceil(n/(2*d+1)))

Fixed submission:
r=int(input())
print(3*r**2)
Buggy python submission (verdict: Time Limit Exceeded):
import itertools

def main():
    N = int(input())
    A = list(map(int, input().split()))
    ans = 0

    for v in itertools.combinations(A, 2):
        ans += v[0] * v[1]
    print(ans % 1000000007)
main()


Fixed submission:
def main():
    N = int(input())
    A = list(map(int, input().split()))
    all_sum = sum(A) ** 2
    st = 0
    for i in range(N):
        st += A[i] ** 2
    print(int(((all_sum - st)//2) % 1000000007))
main()

Buggy python submission (verdict: Time Limit Exceeded):
import itertools

def main():
    N = int(input())
    A = list(map(int, input().split()))
    ans = 0

    for v in itertools.combinations(A, 2):
        ans += v[0] * v[1]
    print(ans % 1000000007)
main()


Fixed submission:
def main():
    N = int(input())
    A = list(map(int, input().split()))
    all_sum = sum(A) ** 2
    st = 0
    for i in range(N):
        st += A[i] ** 2
    print(int(((all_sum - st)//2) % 1000000007))
main()

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    N = int(input())
    A = list(map(int, input().split()))
    ans = 0

    for i in range(N):
        for j in range(1+i, N):
            if i == j:
                continue
            else:
                ans += A[i] * A[j]
    print(ans % 1000000007)
main()


Fixed submission:
def main():
    N = int(input())
    A = list(map(int, input().split()))
    all_sum = sum(A) ** 2
    st = 0
    for i in range(N):
        st += A[i] ** 2
    print(int(((all_sum - st)//2) % 1000000007))
main()
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    X, K, D = list(map(int, input().split()))
    for i in range(K):
        if abs(X - D) > abs(X + D):
            X = X + D
        else:
            X = X - D
            if X <= 0:
                if (i % 2 == 1 and K % 2 == 0) or (i % 2 == 0 and K % 2 == 1):
                    print(abs(X))
                    return
                else:
                    if abs(X - D) < X:
                        print(abs(X - D))
                        return
                    elif abs(X + D) < X:
                        print(abs(X + D))
                        return
    print(abs(X))
main()


Fixed submission:
def main():
    X, K, D = list(map(int, input().split()))
    
    def sgn(X):
        if X > 0:return 1
        if X < 0:return -1
        return 0
    
    if X > 0:
        x_greedy = X - K * D
    else:
        x_greedy = X + K * D
    
    if sgn(X) == sgn(x_greedy):
        print(abs(x_greedy))
        return
    
    x_r = X % D
    x_l = x_r - D

    r_parity = (abs(X - x_r) // D) % 2
    
    if K%2 == r_parity:
        print(abs(x_r))
    else:
        print(abs(x_l))
main()
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    A, B, C = map(int, input().split())
    K = int(input())
    n = 0
    while n < K:
        if C < B or C < A:
            C = C * 2
            n += 1
            if C > B > A:
                print('Yes')
                return
        elif B < A:
            B = B * 2
            n += 1
            if C > B > A:
                print('Yes')
                return
    print('No')
            
main()  



Fixed submission:
def main():
    A, B, C = map(int, input().split())
    K = int(input())

    cnt = 0
    while A >= B:
        B = B * 2
        cnt += 1
    
    while B >= C:
        C = C * 2
        cnt += 1
    
    if cnt <= K:
        print('Yes')
    else:
        print('No')
main()

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    A, B, C = map(int, input().split())
    K = int(input())
    n = 0
    while n < K:
        if C < B or C < A:
            C = C * 2
            n += 1
            if C > B > A:
                print('Yes')
                return
        elif B < A:
            B = B * 2
            n += 1
            if C > B > A:
                print('Yes')
                return
    print('No')
            
main()  



Fixed submission:
def main():
    A, B, C = map(int, input().split())
    K = int(input())

    cnt = 0
    while A >= B:
        B = B * 2
        cnt += 1
    
    while B >= C:
        C = C * 2
        cnt += 1
    
    if cnt <= K:
        print('Yes')
    else:
        print('No')
main()
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    N, K = map(int, input().split())
    l = list(map(int, input().split()))
    
    for i in range(N - K):
        p = 0
        n = 0
        for j in range(K):
            p = p + l[j+i]
            n = n + l[j+i+1]
        if p < n:
            print('Yes')
        else:
            print('No') 
main()



Fixed submission:
def main():
    N, K = map(int, input().split())
    l = list(map(int, input().split()))
    for i in range(K, N):
        if l[i] > l[i-K]:
            print('Yes')
        else:
            print('No')
main()

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    N, K = map(int, input().split())
    l = list(map(int, input().split()))
    t = []
    for i in range(1, N - K + 1):
        if sum(l[i-1:K+i-1]) < sum(l[i:K+i]):
            print('Yes')
        else:
            print('No')
main()  



Fixed submission:
def main():
    N, K = map(int, input().split())
    l = list(map(int, input().split()))
    for i in range(K, N):
        if l[i] > l[i-K]:
            print('Yes')
        else:
            print('No')
main()
Buggy python submission (verdict: Runtime Error):
def main():
    N = str(input())
    N = N[-3]
    N = int(N)
    N = 10 - N
    if N == 10:
        print(0)
    else:
        print(N*100)
main()

Fixed submission:
def main():
    N = int(input())
    if N < 1000:
        print(1000 - N)
        return
    N = str(N)
    N = N[-3] + N[-2] + N[-1]
    N = int(N)
    if N == 0:
        print(0)
        return
    
    print(1000 - N)
    
main()
Buggy python submission (verdict: Runtime Error):
def main():
    sum, leg = map(int, input().split())
    


    for i in range(sum):
        for x in range(sum - i):
            crane = i * 2
            turtle = x * 4
            total = crane + turtle
            if total == leg:
                print('Yes')
                return
    print('No')
    
main()

Fixed submission:
def main():
    l = list(map(int, input().split()))
    for i in range(len(l)):
        if l[i] == 0:
            print(i + 1)
            return
    
main()
Buggy python submission (verdict: Runtime Error):
def main():
    import copy

    num, quantity = map(int, input().split())
    nums = list(map(int, input().split()))
    nums.sort()
    
    if quantity == 0:
        print(num)
        return
    
    i = 0

    minus_num = copy.copy(num)
    plus_num = copy.copy(num)

    while i < len(nums)
        if num not in nums:
            print(num)
            return
        
        if minus_num not in nums:
            print(minus_num)
            return
        
        if plus_num not in nums:
            print(plus_num)
            return
        
        minus_num = minus_num - 1
        plus_num = plus_num + 1
        i = i + 1

main()

Fixed submission:
def main():
    import copy

    num, quantity = map(int, input().split())
    nums = list(map(int, input().split()))
    nums.sort()
    
    if quantity == 0:
        print(num)
        return
    
    i = 0

    minus_num = copy.copy(num)
    plus_num = copy.copy(num)

    while i < len(nums):
        if num not in nums:
            print(num)
            return
        
        if minus_num not in nums:
            print(minus_num)
            return
        
        if plus_num not in nums:
            print(plus_num)
            return
        
        minus_num = minus_num - 1
        plus_num = plus_num + 1

main()

Buggy python submission (verdict: Runtime Error):
def main():
    import copy

    num, quantity = map(int, input().split())
    nums = list(map(int, input().split()))
    nums.sort()
    
    if quantity == 0:
        print(num)
        return
    
    i = 0

    minus_num = copy.copy(num)
    plus_num = copy.copy(num)

    while i = 1
        if num not in nums:
            print(num)
            return
        
        if minus_num not in nums:
            print(minus_num)
            return
        
        if plus_num not in nums:
            print(plus_num)
            return
        
        minus_num = minus_num - 1
        plus_num = plus_num + 1



main()

Fixed submission:
def main():
    import copy

    num, quantity = map(int, input().split())
    nums = list(map(int, input().split()))
    nums.sort()
    
    if quantity == 0:
        print(num)
        return
    
    i = 0

    minus_num = copy.copy(num)
    plus_num = copy.copy(num)

    while i < len(nums):
        if num not in nums:
            print(num)
            return
        
        if minus_num not in nums:
            print(minus_num)
            return
        
        if plus_num not in nums:
            print(plus_num)
            return
        
        minus_num = minus_num - 1
        plus_num = plus_num + 1

main()
Buggy python submission (verdict: Runtime Error):
import copy

def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())

    if V <= W:
        print('NO')
    elif (abs(A-B) / (V-W)) <= t:
        print('YES')
    else:
        print('NO')

main()

Fixed submission:
import copy

def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())

    if V <= W:
        print('NO')
    elif (abs(A-B) / (V-W)) <= T:
        print('YES')
    else:
        print('NO')

main()
Buggy python submission (verdict: Time Limit Exceeded):
times = int(input())
count = 0
nums = list(map(int, input().split()))
total = 1

while count < times:
    total = total * nums[count]
    count += 1

if total < 1000000000000000001:
    print(total)
else:
    print(-1)

Fixed submission:
def main():
    n = int(input())
    l = list(map(int, input().split(' ')))
    l.sort()
    if l[0] == 0:
        print(0)
        return
    
    total = 1

    for i in l:
        total = total * i
        if (total > 1000000000000000000):
            print(-1)
            return
    
    print(total)

main()

Buggy python submission (verdict: Time Limit Exceeded):
times = int(input())
nums = list(map(int, input().split()))
total = 1

for i in nums:
    total = total * i

if total < 1000000000000000001:
    print(total)
else:
    print(-1)


Fixed submission:
def main():
    n = int(input())
    l = list(map(int, input().split(' ')))
    l.sort()
    if l[0] == 0:
        print(0)
        return
    
    total = 1

    for i in l:
        total = total * i
        if (total > 1000000000000000000):
            print(-1)
            return
    
    print(total)

main()

Buggy python submission (verdict: Time Limit Exceeded):
times = int(input())
nums = list(map(int, input().split()))
total = 1

for i in nums:
    total = total * i

if total < 1000000000000000001:
    print(total)
else:
    print(-1)

Fixed submission:
def main():
    n = int(input())
    l = list(map(int, input().split(' ')))
    l.sort()
    if l[0] == 0:
        print(0)
        return
    
    total = 1

    for i in l:
        total = total * i
        if (total > 1000000000000000000):
            print(-1)
            return
    
    print(total)

main()
Buggy python submission (verdict: Runtime Error):
from decimal import * as dec
import math

def main():
    a,b = map(dec, input().split())
    if b < 1:
        print(0)
        return
    ans = (a * b)
    print(math.floor(ans))
main()

Fixed submission:
from decimal import Decimal as dec
import math

def main():
    a,b = map(dec, input().split())
    ans = (a * b)
    print(int(ans))
main()
Buggy python submission (verdict: Runtime Error):
def main():
    N, M = map(int, input().split())
    A = list(map(int, input().split(' ')))
    homework_day = 0
    for i in range(2):
        homework_day = homework_day + A[i]
    if homework_day > N:
        print(-1)
    else:
        print(N - homework_day)
main()

Fixed submission:
def main():
    N, M = map(int, input().split())
    A = list(map(int, input().split(' ')))
    homework_day = 0
    for i in range(len(A)):
        homework_day = homework_day + A[i]
    if homework_day > N:
        print(-1)
    else:
        print(N - homework_day)
main()
Buggy python submission (verdict: Runtime Error):
def main():
    top = list(map(int, input().split()))
    middle = list(map(int, input().split()))
    bottom = list(map(int, input().split()))
    N = int(input())
    taken = []
    for i in range(N):
        taken.append(int(input()))
    
    bingo = []
    bingo.append(top)
    bingo.append(middle)
    bingo.append(bottom)
    temp = [top[0], middle[0], bottom[0]]
    bingo.append(temp)
    temp = [top[1], middle[1], bottom[1]]
    bingo.append(temp)
    temp = [top[2], middle[2], bottom[2]]
    bingo.append(temp)
    temp = [top[0], middle[1], bottom[2]]
    bingo.append(temp)
    temp = [top[2], middle[1], bottom[0]]
    bingo.append(0)
 
 
    cnt = 0
    flag = 0
    for i in range(len(bingo)):
        cnt = 0
        for j in range(len(bingo[i])):
            if bingo[i][j] in taken:
                cnt += 1
        if cnt == 3:
            flag += 1
    
    if flag > 0:
        print('Yes')
    else:
        print('No')
main()

Fixed submission:
def main():
    top = list(map(int, input().split()))
    middle = list(map(int, input().split()))
    bottom = list(map(int, input().split()))
    N = int(input())
    taken = []
    for f in range(N):
        taken.append(int(input()))
    
    bingo = []
    bingo.append(top)
    bingo.append(middle)
    bingo.append(bottom)
    temp = [top[0], middle[0], bottom[0]]
    bingo.append(temp)
    temp = [top[1], middle[1], bottom[1]]
    bingo.append(temp)
    temp = [top[2], middle[2], bottom[2]]
    bingo.append(temp)
    temp = [top[0], middle[1], bottom[2]]
    bingo.append(temp)
    temp = [top[2], middle[1], bottom[0]]
    bingo.append(temp)
    
    if bingo[0][0] in taken and bingo[0][1] in taken and bingo[0][2] in taken:
        print('Yes')
    elif bingo[1][0] in taken and bingo[1][1] in taken and bingo[1][2] in taken:
        print('Yes')
    elif bingo[2][0] in taken and bingo[2][1] in taken and bingo[2][2] in taken:
        print('Yes')
    elif bingo[3][0] in taken and bingo[3][1] in taken and bingo[3][2] in taken:
        print('Yes')
    elif bingo[4][0] in taken and bingo[4][1] in taken and bingo[4][2] in taken:
        print('Yes')
    elif bingo[5][0] in taken and bingo[5][1] in taken and bingo[5][2] in taken:
        print('Yes')
    elif bingo[6][0] in taken and bingo[6][1] in taken and bingo[6][2] in taken:
        print('Yes')
    elif bingo[7][0] in taken and bingo[7][1] in taken and bingo[7][2] in taken:
        print('Yes')
    else:
        print('No')
main()
Buggy python submission (verdict: Runtime Error):
def main():
    A, B, K = map(int, input().split())
    higher = 0
    if A < B:
        smaller = A
    else:
        smaller = B
    l = []
    for i in range(smaller):
        if i == 0:
            continue
        if A % i == 0 and B % i == 0:
            l.append(i)
    if (A and B) == 1:
        print(1)
        return
    elif len(l) == 0:
        print(0)
        return
    print(l[(-1*K)])
main()



Fixed submission:
def main():
    A, B, K = map(int, input().split())
    count = 0

    for i in range(100, 0, -1):
        if (A % i == 0) and (B % i == 0):
            count += 1
            if count == K:
                print(i)
                break
main()

Buggy python submission (verdict: Runtime Error):
def main():
    A, B, K = map(int, input().split())
    higher = 0
    if A < B:
        higher = B
    else:
        higher = A
    l = []
    for i in range(higher):
        if i == 0:
            continue
        if A % i == 0 and B % i == 0:
            l.append(i)
    if len(l) == 0:
        print(1)
        return
    print(l[(-1*K)])
main()



Fixed submission:
def main():
    A, B, K = map(int, input().split())
    count = 0

    for i in range(100, 0, -1):
        if (A % i == 0) and (B % i == 0):
            count += 1
            if count == K:
                print(i)
                break
main()
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
ans = a*b
 
if (ans/2 === 0):
    print('Even')
else:
    print('Odd')

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

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
ans = (a*b)/2

if (ans === 0):
    print('Even')
else:
    print('Odd')

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

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

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