import math
# k 乗根
def sqrt(n: int, k = 2):
    l = k - 1
    if not n: return 0
    y = 1 << (n.bit_length() + l) // k
    x = y + 1
    while y < x:
        x = y
        y = (l * x + n // (x ** l)) // k
    return x

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

g = math.gcd(A, B)

X = sqrt(g)
if X*X == g: # gは平方数
    print('Odd')
else:
    print('Even')