Problem:


Score : 100 points

Problem Statement

AtCoDeer the deer found two positive integers, a and b.
Determine whether the product of a and b is even or odd.

Constraints

1 ≤ a,b ≤ 10000

a and b are integers.

Input

Input is given from Standard Input in the following format:

a b

Output

If the product is odd, print Odd; if it is even, print Even.

Sample Input 1

3 4

Sample Output 1

Even

As 3 × 4 = 12 is even, print Even.

Sample Input 2

1 21

Sample Output 2

Odd

As 1 × 21 = 21 is odd, print Odd.



Sample input:
3 4


Sample output:
Even

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

if A%2==1 and B%2==1:
  print("Odd")
else:
  print("Even")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a*b%2!=0:
	print("Odd")
else:
	print("Even")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())

if (a*b % 2 == 0):
  print("Even")
else:
  print('Odd')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
x = a*b
if x % 2 == 0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a*b%2 == 0:
    print('Even')
else:
    print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a*b%2==0:
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print('Odd' if (a*b)%2!=0 else 'Even')

Submission status: Accepted

Solution code:
a,b=input().split()
a=int(a)
b=int(b)
c=a*b%2
if c==0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
c = a * b
if (c % 2) == 0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
if (a*b)%2==0:
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c = a * b
if c % 2 == 1:
  print('Odd')
else:
  print('Even')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())

if a * b % 2 == 0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
a, b = input().split()
if (int(a) * int(b)) % 2 == 0:
    print('Even')
else:
    print('Odd')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a*b%2 == 0:
	print("Even")
else:
	print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if (a*b)%2==0:
    print('Even')
else:
    print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print('Even' if a * b % 2 == 0 else 'Odd')

Submission status: Accepted

Solution code:
print('OEdvde n'['0'in(s:=input())or'4'in s::2])

Submission status: Accepted

Solution code:
print('EOvdedn'[eval(input().replace(*' *'))%2::2])

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if (A*B)%2==0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

a,b = I()
ans = a*b
if ans % 2== 0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a * b % 2 == 0:
	print ("Even")
else :
	print ("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a%2==0 or b%2==0:
    print('Even')
else:
    print('Odd')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())

if a*b % 2 ==0:
	print("Even")
else:
	print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
if (a * b) % 2 == 0:
    print('Even')

else:
    print('Odd')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print('Even' if (a*b)%2==0 else 'Odd')

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

a,b = I()
if a*b%2 == 0:
    print('Even')
else:
    print('Odd')

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
result = x*y
if result%2 == 0:
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
 
n=a*b
if n%2==0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

ab = a * b

ab_mod = ab % 2

if (ab_mod == 0 ):
    print("Even")

else:
    print("Odd")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())


if (a*b)%2 == 0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

a, b = map(int, input().split())

if (a * b) % 2 != 0:
    print('Odd')
else:
    print('Even')

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
if a * b % 2 ==0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if (a*b)%2 == 0:
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a %2==0 or b%2==0:
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print('Odd' if a * b % 2 == 1 else 'Even')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if (a*b) % 2:
    print('Odd')
else:
    print('Even')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if (a*b) % 2:
  print('Odd')
else:
  print('Even')

Submission status: Accepted

Solution code:
a, b = map (int, input().split())
if a%2 != 0 and b%2 != 0:
  print("Odd")
else:
  print("Even")

Submission status: Accepted

Solution code:
A,B = input().split()
A = int(A)
B = int(B)
if A * B % 2 ==0:
  print ('Even')
else :
  print ('Odd')

Submission status: Accepted

Solution code:
a,b = input().split()
a = int(a)
b = int(b)
c = a * b
if c % 2 == 0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a, b = map(int, input().split())
if a * b % 2 == 0:
  x = "Even"
else:
  x = "Odd"
print(x)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())

if (a*b) % 2 == 0:
	print('Even')
else:
	print('Odd')

Submission status: Accepted

Solution code:
a,b=input().split()
a=int(a)
b=int(b)
if (a*b)%2 == 1 :
  print('Odd')
else:
  print('Even')

Submission status: Accepted

Solution code:
a,b=input().split()
a=int(a)
b=int(b)
c=a*b
if c%2==1:
  print('Odd')
else:
  print('Even')

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
if (a[0] * a[1]) % 2:
    print("Odd")
else:
    print("Even")

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))

print("Even" if a*b % 2 == 0 else "Odd")

Submission status: Accepted

Solution code:
from sys import stdin

data = stdin.readlines()

a = int(data[0].split()[0])

b = int(data[0].split()[1])

x = a * b

if x % 2 == 0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def MI():return map(int,input().split())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RA():return map(int,open(0).read().split())
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
    #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in range(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in range(base**n):s=[tb//(base**bt)%base for bt in range(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

mo=10**9+7
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**7)
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
input=lambda: sys.stdin.readline().rstrip()

class Tree:
    def __init__(self,inp_size=None,ls=None,init=True,index=1):
        self.LCA_init_stat=False
        self.ETtable=[]
        if init:
            if ls==None:
                self.stdin(inp_size,index=index)
            else:
                self.node_size=len(ls)+1
                self.edges,_=GI(self.node_size,self.node_size-1,ls,index=index)
        return
 
    def stdin(self,inp_size=None,index=1):
        if inp_size==None:
            self.node_size=int(input())
        else:
            self.node_size=inp_size
        self.edges,_=GI(self.node_size,self.node_size-1,index=index)
        return
    
    def listin(self,ls,index=0):
        self.node_size=len(ls)+1
        self.edges,_=GI(self.node_size,self.node_size-1,ls,index=index)
        return
 
    def dfs(self,x,func=lambda pr,prv,nx,dist:prv+dist,root_v=0):
        q=deque([x])
        v=[None]*self.node_size
        v[x]=root_v
        while q:
            c=q.pop()
            for nb,d in self.edges[c]:
                if v[nb]==None:
                    q.append(nb)
                    v[nb]=func(c,v[c],nb,d)
        return v
 
    def bfs(self,x,func=lambda pr,prv,nx,dist:prv+dist,root_v=0):
        q=deque([x])
        v=[None]*self.node_size
        v[x]=root_v
        while q:
            c=q.popleft()
            for nb,d in self.edges[c]:
                if v[nb]==None:
                    q.append(nb)
                    v[nb]=func(c,v[c],nb,d)
        return v
 
    def parent(self,x):
        return self.dfs(0,func=lambda pr,prv,nx,dist:pr,root_v=-1)
 
    def topological_sort(self,x):  # return topological sort of the tree
        tps=[]
        q=deque([x])
        v=[None]*self.node_size
        v[x]=0
        while q:
            c=q.popleft()
            tps.append(c)
            for nb,d in self.edges[c]:
                if v[nb]==None:
                    q.append(nb)
                    v[nb]=0
        return tps
 
    def EulerTour(self,x):
        q=deque()
        q.append(x)
        self.depth=[None]*self.node_size
        self.depth[x]=0
        self.ETtable=[]
        self.ETdepth=[]
        self.ETin=[-1]*self.node_size
        self.ETout=[-1]*self.node_size
        cnt=0
        while q:
            c=q.pop()
            if c<0:
                ce=~c
            else:
                ce=c
                for nb,d in self.edges[ce]:
                    if self.depth[nb]==None:
                        q.append(~ce)
                        q.append(nb)
                        self.depth[nb]=self.depth[ce]+1
            self.ETtable.append(ce)
            self.ETdepth.append(self.depth[ce])
            if self.ETin[ce]==-1:
                self.ETin[ce]=cnt
            else:
                self.ETout[ce]=cnt
            cnt+=1
        return
    
    def LCA_init(self,root):
        self.EulerTour(root)
        self.st=SparseTable(self.ETdepth,init_func=min,init_idl=inf)
        #self.st=SegTree(self.node_size*2-1,self.ETdepth,function=min,ide=inf)
        self.LCA_init_stat=True
        return
    
    def LCA(self,root,x,y):
        if self.LCA_init_stat==False:
            self.LCA_init(root)
        xin,xout=self.ETin[x],self.ETout[x]
        yin,yout=self.ETin[y],self.ETout[y]
        a=min(xin,yin)
        b=max(xout,yout,xin,yin)
        id_of_min_dep_in_et=self.st.query_id(a,b+1)
        return self.ETtable[id_of_min_dep_in_et]
 
    def __str__(self):
        return  str(self.edges)
 
    def show(self):
        if all([all([d==1 for nd,d in e]) for e in self.edges]):
            print( [[nd for nd,d in e] for e in self.edges] )
        else:
            print(self)

class SparseTable: # O(N log N) for init, O(1) for query(l,r)
    def __init__(self,ls,init_func=min,init_idl=float('inf')):
        self.func=init_func
        self.idl=init_idl
        self.size=len(ls)
        self.N0=self.size.bit_length()
        self.table=[ls[:]]
        self.index=[list(range(self.size))]
        self.lg=[0]*(self.size+1)
        
        for i in range(2,self.size+1):
            self.lg[i]=self.lg[i>>1]+1
 
        for i in range(self.N0):
            tmp=[self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) for j in range(self.size)]
            tmp_id=[self.index[i][j] if self.table[i][j]==self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) else self.index[i][min(j+(1<<i),self.size-1)] for j in range(self.size)]
            self.table+=[tmp]
            self.index+=[tmp_id]
    
    # return func of [l,r)
    def query(self,l,r):
        if r>self.size:r=self.size
        #N=(r-l).bit_length()-1
        N=self.lg[r-l]
        return self.func(self.table[N][l],self.table[N][max(0,r-(1<<N))])
    
    # return index of which val[i] = func of v among [l,r)
    def query_id(self,l,r):
        if r>self.size:r=self.size
        #N=(r-l).bit_length()-1
        N=self.lg[r-l]
        a,b=self.index[N][l],self.index[N][max(0,r-(1<<N))]
        if self.table[0][a]==self.func(self.table[N][l],self.table[N][max(0,r-(1<<N))]):
            b=a
        return b
    
    # return boundary index of r such that func({table[i]} =< x , i in [pos,r]
    def right_bound(self,pos,x):
        k=(self.size-pos).bit_length()
        for j in range(k)[::-1]:
            nx=pos+(1<<j)
            if nx<n and self.query(pos,nx+1)<=x:
                pos+=(1<<j)
        return pos
    
    # return boundary index of l such that func({table[i]} =< x , i in [l,pos]
    def left_bound(self,pos,x):
        k=pos.bit_length()
        for j in range(k)[::-1]:
            nx=pos-(1<<j)
            if 0<=nx and self.query(nx,pos+1)<=x:
                pos-=(1<<j)
        return pos
 
    def __str__(self):
        return str(self.table[0])
 
    def print(self):
        for i in self.table:
            print(*i)


show_flg=False
show_flg=True


ans=0
a,b=LI()
print(['Odd','Even'][a*b%2==0])

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if (a*b)%2:
    print("Odd")
else:
    print("Even")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

print("Even") if a * b % 2 == 0 else print("Odd")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a, b = map(int, input().split())
if a*b % 2 == 0:
    print('Even')
else:
    print('Odd')

Submission status: Accepted

Solution code:
input = list(map(int,input().split()))

print("Odd" if (input[0]*input[1])%2 else "Even" )

Submission status: Accepted

Solution code:
A,B = map(int, input().split())

print("Even" if A % 2 == 0 or B % 2 == 0 else "Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c = a * b
if(c % 2 == 0):
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print("Even" if a*b % 2 == 0 else "Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

c = a * b

if c % 2 == 0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:

a,b = map(int,input().split())

total = a * b
if total % 2 == 0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
c = a * b
d = c%2
if d == 1:
    print('Odd')
else:
    print('Even')

Submission status: Accepted

Solution code:
a,b = input().split()
times = int(a)*int(b)

if times%2 == 0:
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print('Odd' if (a * b) % 2 == 1 else 'Even')

Submission status: Accepted

Solution code:
num12 = input().split(" ")
f = int(num12[0]) * int(num12[1])
if f % 2 == 0:
 print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a%2==0 or b%2==0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if (a*b) % 2 == 0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, input().split())
    print('Odd') if a*b % 2 != 0 else print('Even')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a*b%2 == 0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())

ans = a*b

if ans%2 == 0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
c = a*b
if c%2==0:
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if(a%2 == 0):
  print('Even')
elif(b%2 == 0):
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if(a*b%2 == 0):
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
A, B = list(map(int,input().split(" ")))
if A*B%2 == 1:
  print("Odd")
else:
  print("Even")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())

if (a*b)%2==1:
  print('Odd')
else:
  print('Even')

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
a,b=(map(int,input().split()))

if a*b%2==0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())


if (a*b)%2==1:
    print("Odd")
else:
    print("Even")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a*b % 2 == 1:
  print('Odd')
else:
  print('Even')

Submission status: Accepted

Solution code:
def product(a, b):
    return a * b

def judge(num):
    if num % 2 == 0:
        print('Even')
    else:
        print('Odd')

a, b = map(int, input().split())

judge(product(a, b))

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

c = a * b

if c % 2 == 0:
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print("EOvdedn"[a*b%2::2])

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if (a*b %2 == 0):
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if (a%2==0 or b%2==0):
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print('Even' if a * b % 2 == 0 else 'Odd')

Submission status: Accepted

Solution code:
b,c=map(int,input().split())
if b*c%2==1:
  print("Odd")
else:
  print("Even")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
print("Even" if a*b % 2 == 0 else "Odd")

Submission status: Accepted

Solution code:
n,m = map(int, input().split())

if (n*m) %2 ==0:
    print("Even")

else:
    print("Odd")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
c = a * b
if c % 2 == 1:
    print("Odd")
else :
    print("Even")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a%2==0 or b%2==0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a*b%2 == 0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
print("Odd" if a*b%2 == 1 else "Even")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print("Even" if (a*b)%2==0 else "Odd")

Submission status: Accepted

Solution code:
a, b = list(map(int, input().strip().split()))
c = a*b
if c%2 == 0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a % 2 == 0 or b % 2 == 0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

l = [int(i) for i in input().split()]

a = l[0]
b = l[1]

x = a * b

if (l[0] * l[1]) % 2 == 0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
ls = input().split(" ")

a = int(ls[0])
b = int(ls[1])

c = a * b

if c % 2 == 1:
  print("Odd")
else:
  print("Even")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a*b%2 == 0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if int(a*b%2) == 1:
  print('Odd')
else:
  print('Even')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if (a * b) % 2 == 0:
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if (a*b) % 2 == 0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
# coding-utf8 #

a, b = map(int, input().split())

if a * b % 2 == 0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().split()]
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c = (a * b) % 2
if c == 0:
	print('Even')
else:
	print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

c = a * b
if c % 2 == 0:
    print('Even')
else:
    print('Odd')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())

if (a * b) % 2 == 0:
    print("Even")
else:
    print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c = a * b

if c % 2 == 0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

print('Odd' if (a*b)%2==1 else 'Even')

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))

c = i[0] * i[1]

ans = 'Even' if c % 2 == 0 else 'Odd'
print(ans)

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().split()]
print("Odd" if (a * b) % 2 == 1 else "Even")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print('Even') if (a * b) % 2 == 0 else print('Odd')

Submission status: Accepted

Solution code:
A,B = map(int, input().split())


if (A*B)%2==1:
    print('Odd')
else:
    print('Even')

Submission status: Accepted

Solution code:
def actual(a, b):
    if (a * b) % 2 == 0:
        return 'Even'

    return 'Odd'

a, b = map(int, input().split())
print(actual(a, b))

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a*b%2==1:
    print("Odd")
else:
    print("Even")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a*b % 2 == 0 :
  print("Even")
else :
  print("Odd")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
print("Even" if (a*b)%2 == 0 else "Odd")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a*b % 2 == 0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
import sys
from itertools import combinations
import math


def I(): return int(sys.stdin.readline().rstrip())


def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))


def S(): return sys.stdin.readline().rstrip()


def LS(): return list(sys.stdin.readline().rstrip().split())


a, b = LI()
if (a*b) % 2 == 0:
    print('Even')
else:
    print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
print("EOvdedn"[a*b%2::2])

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print("Even" if a*b%2 == 0 else "Odd")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a%2==0 or b%2==0:print('Even')
else:print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
 
print("Even" if a*b%2==0 else "Odd")

Submission status: Accepted

Solution code:
# 20200610_yorukatsu_g.py
A, B = map(int,input().split())
print("Even" if A*B%2==0 else "Odd")

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    a, b = map(int, input().split())
    print("Even" if a * b % 2 == 0 else "Odd")


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
a, b = map(int, input().split())
if (a*b) % 2 == 0:
    print('Even')
else:
    print('Odd')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a*b %2 == 0:
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

a, b = map(int, input().split())

print("Even" if a * b % 2 == 0 else "Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split(' '))

print("Even" if a % 2 == 0 or b % 2 == 0 else "Odd")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a*b % 2== 1:
  print("Odd")

else:
  print("Even")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
ab=a*b
 
if ab%2 == 1:
  print("Odd")
else:
  print("Even")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
print("Even" if a*b%2==0 else "Odd")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a * b % 2 == 0:
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())  
if 1<=a and b<=10000:             
    if (a*b)%2==0:                
        print('Even')             
    else:                         
        print('Odd')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a * b % 2 == 0: print('Even')
else: print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if not a%2 or not b%2:
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
print('EOvdedn'[(sum([1 for i in list(map(int,input().split())) if i%2!=0])//2)::2])

Submission status: Accepted

Solution code:
print('Even' if [1 for i in list(map(int,input().split())) if i%2==0] else 'Odd')

Submission status: Accepted

Solution code:
print('EvenEvenOdd'[sum([4 for i in list(map(int,input().split())) if i%2!=0]):][:4])

Submission status: Accepted

Solution code:
print(['Even','Even','Odd'][len([1 for i in list(map(int,input().split())) if i%2!=0])])

Submission status: Accepted

Solution code:
print('Odd' if len([1 for i in list(map(int,input().split())) if i%2!=0])==2 else 'Even')

Submission status: Accepted

Solution code:
import functools
import operator
print('Even' if (functools.reduce(operator.mul,list(map(int,input().split()))))%2==0 else 'Odd')

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

def main():
    a, b = map(int, input().split())
    m = a * b
    if m % 2 == 0:
        print('Even')
    else:
        print('Odd')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
xy = x * y
if xy % 2 == 0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a * b % 2 ==0:
	print("Even")
else:
	print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if (a*b) % 2 == 0:
    print('Even')
else:
    print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a*b%2 ==0:
    print('Even')
else:
    print('Odd')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
c= a*b
if c%2 == 0:
   print ("Even")
else:
   print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
s = a*b
if s%2 == 1:
  print('Odd')
else:
  print('Even')

Submission status: Accepted

Solution code:
line =  input().split()

a =int(line[0])
b =int(line[1])
if a*b%2 ==0:
  print("Even")
else:
  print("Odd")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if (a * b) % 2 == 0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if (a * b) % 2 == 0:
  print('Even')
else:
  print('Odd')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())

if (a*b)%2 == 0:
  print("Even")
else:
  print("Odd")