require 'prime'

A, B = gets.split.map(&:to_i)

a_div = A.prime_division
b_div = B.prime_division

counter = Hash.new(0)

a_div.each do |x, e|
  counter[x] += e
end

cnt = 1

b_div.each do |x, e|
  next if counter[x] == 0

  v = [counter[x], e].min

  cnt *= (v + 1)
end

if cnt.even?
  puts 'Even'
else
  puts 'Odd'
end