import math def make_divisors(n): lower_divisors , upper_divisors = [], [] i = 1 while i*i <= n: if n % i == 0: lower_divisors.append(i) if i != n // i: upper_divisors.append(n//i) i += 1 return lower_divisors + upper_divisors[::-1] A,B = map(int,input().split()) if len(make_divisors(math.gcd(A, B)))%2==0: print('Even') else: print('Odd')