output_description: If the product is odd, print `Odd`; if it is even, print `Even`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      a b
attempt: # coding: utf-8
  # Your code here!
  # coding: utf-8
  from fractions import gcd
  from functools import reduce
  import sys
  
  sys.setrecursionlimit(200000000)
  from inspect import currentframe
  
  
  # my functions here!
  # 標準エラー出力
  def printargs2err(*args):
      names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}
      print(
          ", ".join(names.get(id(arg), "???") + " : " + repr(arg) for arg in args),
          file=sys.stderr,
      )
  
  
  def debug(x):
      print(x, file=sys.stderr)
  
  
  def printglobals():
      for symbol, value in globals().items():
          print('symbol="%s"、value=%s' % (symbol, value), file=sys.stderr)
  
  
  def printlocals():
      for symbol, value in locals().items():
          print('symbol="%s"、value=%s' % (symbol, value), file=sys.stderr)
  
  
  # 入力（後でいじる）
  def pin(type=int):
      return map(type, input().split())
  
  
  """
  """
  
  
  # solution:
  # 繰り返し自乗法だよ
  # これはnのp乗をmで割ったあまりをだすよ
  def modular_w_binary_method(n, m, p):
      ans = 1 if n > 0 else 0
      while p > 0:
          if p % 2 == 1:
              ans = (ans * n) % m
          n = (n**2) % m
          p //= 2
      return ans
  
  
  # mod上でのaの逆元を出すよ
  """
      フェルマーの小定理より a**(p)%p==a isTrue
      これを利用すれば a**(p-2)%p==a**(-1) isTrue
      元と逆元とをかけてpで割れば1が余るよ！
  """
  
  
  def modular_inverse(a, prime):
      return modular_w_binary_method(a, prime, prime - 2)
  
  
  # 逆元を使うと容易に頑張れるｃ
  def conbination(n, a, mod=10**9 + 7):
      # cはイラない
      res = 1
      for s in range(a):
          res = (res * (n - s) * (modular_inverse(s + 1, mod))) % mod
  
      return res
  
  
  # 操作から作れるものの組み合わせは何個かー＞同じものでも違う方法で構成できるかから考える方法もある
  
  
  # input
  def resolve():
      a, b = pin()
      print(["Odd", "Even"][(a * b + 1) % 2])
      return
      # print([["NA","YYMM"],["MMYY","AMBIGUOUS"]][cMMYY][cYYMM])
  
  
  # if __name__=="__main__":resolve()
  """
  #printデバッグ消した？
  #前の問題の結果見てないのに次の問題に行くの？
  """
  """
  お前カッコ閉じるの忘れてるだろ
  """
  import sys
  from io import StringIO
  import unittest
  
  
  class TestClass(unittest.TestCase):
      def assertIO(self, input, output):
          stdout, stdin = sys.stdout, sys.stdin
          sys.stdout, sys.stdin = StringIO(), StringIO(input)
          resolve()
          sys.stdout.seek(0)
          out = sys.stdout.read()[:-1]
          sys.stdout, sys.stdin = stdout, stdin
          self.assertEqual(out, output)
  
      def test_入力例_1(self):
          input = """3 4"""
          output = """Even"""
          self.assertIO(input, output)
  
      def test_入力例_2(self):
          input = """1 21"""
          output = """Odd"""
          self.assertIO(input, output)
  
  
  if __name__ == "__main__":
      resolve()
  
problem_description: Statement
  
  AtCoDeer the deer found two positive integers, a and b. Determine whether the
  product of a and b is even or odd.
samples: [{"input": "3 4", "output": "Even\n    \n\nAs 3 \u00d7 4 = 12 is even, print `Even`.\n\n* * *"}, {"input": "1 21", "output": "Odd\n    \n\nAs 1 \u00d7 21 = 21 is odd, print `Odd`."}]