def m_div(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)

    # divisors.sort()
    return divisors

a,b = map(int, input().split())

union = (set(m_div(a)) &  set(m_div(b)))

if len(union)%2==0:
    print("Even")
else:
    print("Odd")