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)
	return 1 if n == 1
	res = Hash.new(0)
	ex = 0
	while n % 2 == 0 do
		res[2] += 1
		n /= 2
	end
	f = 3
	while f * f <= n
		if n % f == 0 then
			res[f] += 1
			n /= f
		else
			f += 2
		end
	end
	res[n] += 1 if n != 1
	res.values.map{|x| x+1}.inject(:*)
end

g = gcd(A, B)

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