a,b = map(int, input().split())
import math
g = math.gcd(a, b)

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)

    #divisors.sort(reverse=True)
    return divisors
d = make_divisors(g)

if len(d)%2 == 0:
    print('Even')
else:
    print('Odd')