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

def gcd(a,b):
    while b != 0:
        r = a % b
        a = b
        b = r
    return a   

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    return divisors

if len(make_divisors(gcd(A,B))) % 2 == 0:
    print("Even")
else:
    print("Odd")