def gcd(a,b):
    while b>0:  a,b=b,a%b
    return a
A,B=map(int,input().split())
N=gcd(A,B)
p=[1]+[i for i in range(2,int(N**0.5)+1) if N%i<1]
n=len(p)*2-(p[-1]**2==N)
print(["Even","Odd"][n&1])