A, B = map(int, input().split())
def bit_digits(n):
    tmp = n
    cnt = 0
    while tmp:
        tmp >>= 1
        cnt += 1
    return cnt
def issquare(n: int):
    l, r = 0, n + 1
    d = (l + r) // 2
    cnt = bit_digits(n+1)
    for _ in range(cnt + 1):
        if d * d <= n:
            l = d
            d = (l + r) // 2
        else:
            r = d
            d = (l + r) // 2
    return d
def gcd(x, y):
    k, l = x, y
    while l:
        k, l = l, k % l
    return k
g = gcd(A, B)
d = issquare(g)
if d * d == g:
    print("Odd")
else:
    print("Even")