import math
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())
g = math.gcd(a, b)
ctr = collections.Counter(get_primes(g))
res = 1
for x in ctr.values():
    res *= x + 1
if res % 2 == 1:
    print('Odd')
else:
    print('Even')