from math import gcd
def divisor(n):
  cd = []
  i = 1
  while i*i <= n:
    if n%i==0:
      cd.append(i)
      if i != n//i:
        cd.append(n//i)
    i += 1
  return cd

def check():
  A, B = map(int, input().split())
  g = gcd(A,B)
  a = len(divisor(g))
  if a%2==0:
    return 'Even'
  return 'Odd'
print(check())