import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

def getlist():
	return list(map(int, input().split()))

from fractions import gcd

num = 10 ** 6 + 1 #適当に値を入れる
L = [1 for i in range(num)]; L[0] = 0; L[1] = 0
plist = []
for i in range(num):
	if L[i] == 1:
		plist.append(i); c = 2
		while i * c <= num - 1:
			L[i * c] = 0; c += 1

#素因数分解の結果を辞書型として返す
def prime_factorization(N):
	D = defaultdict(int)
	amari = 1
	for i in plist:
		while N % i == 0:
			D[i] += 1; N = int(N // i)

	if N != 1:
		amari = N

	return D, amari

#処理内容
def main():
	A, B = getlist()
	GCD = gcd(A, B)
	fac, amari = prime_factorization(GCD)
	ans = "Odd"
	for key, val in fac.items():
		if val % 2 == 1:
			ans = "Even"

	if amari != 1:
		sq = int((amari ** 0.5) // 1)
		if sq ** 2 != amari:
			ans = "Even"


	print(ans)


if __name__ == '__main__':
	main()