from math import gcd
a, b = map(int, input().split())
g = gcd(a, b)
def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]
l = make_divisors(g)
if len(l) % 2 == 1:
    print("Odd")
else:
    print("Even")