def gcd(a: int, b: int) -> int:
    """a, bの最大公約数(greatest common divisor: GCD)を求める
    計算量: O(log(min(a, b)))
    """
    while b:
        a, b = b, a % b
    return a

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


gcd_ = gcd(a, b)
if int(gcd_ ** 0.5) == gcd_ ** 0.5:
    print("Odd")
else:
    print("Even")