import collections

def get_primes(n):
    res = []
    x = 2
    while n >= x*x:
        while n % x == 0:
            n //= x
            res.append(x)
        x += 1
    if n != 1:
        res.append(n)
    return res

a, b = map(int, input().split())
ctr_a = collections.Counter(get_primes(a))
ctr_b = collections.Counter(get_primes(b))
res = 0
for x in ctr_b & ctr_a:
    res += (ctr_a[x] + 1) * (ctr_b[x] + 1)
if res == 0 or res % 2 == 1:
    print('Odd')
else:
    print('Even')