#最大公約数
def gcd(m,n):
    x,y=max(m,n),min(m,n)
    if x%y==0:
        return y
    else:
        while x%y!=0:
            z=x%y
            x,y=y,z
        else:
            return z

#素因数分解
def Prime_Factorization(N):
    if N<0:
        R=[[-1,1]]
    else:
        R=[]
        
    N=abs(N)
    k=2
    while k*k<=N:
        if N%k==0:
            C=0
            while N%k==0:
                C+=1
                N//=k
            R.append([k,C])
        k+=1
    
    if N!=1:
        R.append([N,1])
    if not R:
        R.append([N,1])

    return R

def Euler_Totient(N):
    N=abs(N)
    if N==1:
        return 1
    
    H=Prime_Factorization(N)
    R=1
    for (p,e) in H:
        R*=p**(e-1)*(p-1)
    return R

def Divisor_Sigma(N,K=1):
    H=Prime_Factorization(N)

    R=1
    if K==0:
        for (_,e) in H:
            R*=(e+1)
    else:
        for (p,e) in H:
            R*=(p**((e+1)*K)-1)//(p**K-1)
    return R

A,B=map(int,input().split())
X=gcd(A,B)
S=Divisor_Sigma(X,0)

if S%2:
    print("Odd")
else:
    print("Even")