from math import gcd
def create_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()
  return divisors

a,b=map(int,input().split())
d=gcd(a,b)
div_ab=create_divisors(d)
if len(div_ab)%2==0:
  print("Even")
else:
  print("Odd")