A, B = gets.split(" ").map{|s| s.to_i}

def gcd(x, y)
	if y == 0 then
		x
	else
		gcd(y, x%y)
	end
end

def nod(n)
	res = 1
	a = 2
	while a*a <= n do
		next if n % a != 0
		ex = 0
		while n % a == 0 do
			ex += 1
			n /= a
		end
		res *= ex + 1
	end
	res *= 2 if n != 1
	res
end

g = gcd(A, B)

puts nod(g) % 2 == 0 ? "Even" : "Odd"