Problem:


Score : 100 points

Problem Statement

You are given integers A and B, each between 1 and 3 (inclusive).

Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number.

Constraints

All values in input are integers.

1 \leq A, B \leq 3

Input

Input is given from Standard Input in the following format:

A B

Output

If there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.

Sample Input 1

3 1

Sample Output 1

Yes

Let C = 3. Then, A \times B \times C = 3 \times 1 \times 3 = 9, which is an odd number.

Sample Input 2

1 2

Sample Output 2

No

Sample Input 3

2 2

Sample Output 3

No



Sample input:
3 1


Sample output:
Yes

Submission status: Accepted

Solution code:
A,B = map(int, input().split()) 
if A*B%2==0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
# coding: utf-8

# https://atcoder.jp/contests/abc109
# 18:15-


def main():
    a, b = map(int, input().split())
    if a % 2 == 1 and b % 2 == 1:
        return "Yes"
    else:
        return "No"


print(main())

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
if x % 2 == 1 and y % 2 == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if a != 2 and b != 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

if a*b%2==0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
print("Yes" if eval(input().replace(" ","*"))%2!=0 else "No")

Submission status: Accepted

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

ans = "Yes"
if (A % 2 == 0 or B % 2 == 0):
  ans = "No"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

if (A % 2 == 1 and B % 2 == 1):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

A,B = map(int, input().split())

for C in range(1,4):
    if A*B*C % 2 == 1:
        print("Yes")
        sys.exit()

print("No")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a % 2 == 1 and b % 2 == 1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a == 2 or b == 2:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print("YNeos"[not (A * B) & 1::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18
# ----------------------------------------------------------- #

a, b = Is()
if a*b % 2 != 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a % 2 == 1 and b % 2 == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

flag=False
for c in range(1,4):
    if a*b*c % 2 !=0:
        flag=True
        break

if flag:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
ok = False
for i in range(1, 4):
    if a*b*i % 2 == 1:
        ok = True
if ok:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
ans="No"
for c in range(1,4):
  if (a*b*c)%2!=0:
    ans="Yes"
    break
print(ans)

Submission status: Accepted

Solution code:
a,b=map(str,input().split())
if "2" in a or "2" in b:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

A,B = inputIL()

if A*B %2 == 1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

print('Yes') if A * B % 2 == 1 else print('No')

Submission status: Accepted

Solution code:
inf = 10 ** 15
mod = 10 ** 9 + 7
a,b = map(int, input().split())
if a*b % 2 == 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    a, b = map(int, (input().split()))
    ans = False
    for i in range(1, 4):
        if a * b * i % 2 == 1:
            ans = True
    if ans:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

Submission status: Accepted

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

if A % 2 == 0 or B % 2 == 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

odd_counts = len([i for i in range(1, 3 + 1) if (A * B * i) % 2 == 1])
if odd_counts > 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A, B = lr()
bl = (A*B)&1
print('Yes' if bl else 'No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)


def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1               # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b = mi()
    print('No') if a % 2 == 0 or b % 2 == 0 else print('Yes')


if __name__ == "__main__":
    main()

Submission status: Accepted

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

    if A%2 != 0 and B%2 != 0:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':

    ABC_109_A()

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
print('Yes' if ((A*B)%2==1 or (A*B*2)%2==1 or (A*B*3)%2==1) else 'No')

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A * B % 2 == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

if a%2==0 or b%2==0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
n = A * B
if n % 2 == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = list(map(int,input().split()))
print('Yes' if (A*B)%2 else 'No')

Submission status: Accepted

Solution code:
A,B = map(int, input().split())
if A%2 == 0 or B%2 == 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import sys
A, B = map(int, input().split())
flag = 0
for i in range(1,3):
    if ((A*B*i)%2)!=0:
        print('Yes')
        flag=1
        sys.exit()

if flag!=1:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a%2==1 and b%2==1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A, B = list(map(int,input().split()))
ans = 'No'
for i in range(3):
    if A*B*(i+1)%2 == 1:
        ans = 'Yes'
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
if (A*B) % 2 != 0:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
a, b = [int(a) for a in input().split()]
print('Yes' if a * b % 2 == 1 else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
for c in range(1, 4):
    if a*b*c % 2 == 1:
        print('Yes')
        exit()
print('No')

Submission status: Accepted

Solution code:
print("NYoe s"[eval(input().replace(" ","*"))%2::2])

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
print('No') if a==2 or b==2 else print('Yes')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a % 2 != 0 and b%2 != 0:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

A, B = map(int, input().split())

if A % 2 == 0 or B % 2 == 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:

ab = list(map(int,input().split()))

if 2 not in ab:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
# ABC109A

a, b = map(int, input().split())
if a*b % 2 == 1 or a*b*2 % 2 == 1 or a*b*3 % 2 == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().split()]
print('Yes') if (a % 2) & (b % 2) else print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b = map(int, input().split())
print("No") if a * b % 2 == 0 else print("Yes")

Submission status: Accepted

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

for c in range(1,4):
    if(a*b*c % 2 == 1):
        print('Yes')
        exit()
print('No')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print('Yes' if a%2==1 and b%2==1 else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a != 2 and b != 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

if (a * b % 2 == 0):
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

print('Yes' if (A*B)%2==1 else 'No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(A: int, B: int):
    print(YES if A * B % 2 == 1 else NO)


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a='YNeos'
print(a[1::2]if '2' in input()else a[::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a*b%2==0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b=map(int, input().split())
    if a*b%2==0:
        print('No')
    else:
        print('Yes')
resolve()

Submission status: Accepted

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

if (a * b) % 2 == 0:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print("Yes" if a%2==1 and b%2==1 else "No")

Submission status: Accepted

Solution code:
# AtCoder
A, B = map(int, input().split())
if A*B % 2 == 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

if (a * b) % 2 == 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print("Yes" if A%2 == 1 and B%2 == 1 else "No")

Submission status: Accepted

Solution code:
x = input().split()
a = int(x[0])
b = int(x[1])
if a % 2 != 0 and b % 2 != 0:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print("Yes" if a % 2 != 0 and b % 2 != 0 else "No")
#print(["Yes", "No"][a * b % 2 == 0] //a*b%2が0なら"Yes", 0以外なら"No"

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
ans = 0
for i in range(1, 4):
  if a*b*i%2 == 1:
    ans += 1
    
if ans > 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a==2 or b==2:
  print('No')
else:
  print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    A, B = map(int, input().split())
    if A == 2 or B == 2: print("No")
    else: print("Yes")

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a!=2 and b!=2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

print("Yes" if (a*b) % 2 != 0 else "No")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    def main():
        A,B=map(int,input().split())
        for i in range(1,4):
            if (A*B*i)%2==1:
                return 'Yes'
        return 'No'
    print(main())

resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    a, b = (int(i) for i in input().split())
    ans = a*b
    if any(a*b*c % 2 == 1 for c in range(1, 4)):
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = [int(i) for i in input().split(' ')]
x = a*b
b = 'No'
for i in range(1,4):
    if not x*i %2==0:
        b='Yes'

print(b)

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
for c in range(1,4):
    if (a*b*c) % 2:
        print("Yes")
        break
else:
    print("No")

Submission status: Accepted

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

if (A * B) % 2 == 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
flag = 0
for i in range(1,4):
    if (A*B*i)%2==1:
        flag = 1
        break
if flag==1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def resolve():
  a, b = map(int, input().split())
  if a % 2 == 1 and b % 2 == 1:
    print('Yes')
  else:
    print('No')
  return

if __name__ == "__main__":
  resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B=map(int, input().split())
if A%2==0 or B%2==0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
if A%2 == 1 and B%2 == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if A * B % 2 == 1:
    print ('Yes')
else:
    print ('No')

Submission status: Accepted

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

    if (a * b) % 2 == 1:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, input().split())
    print("Yes" if a * b % 2 == 1 else "No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if (a*b)&1:print('Yes')
else:print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B = MAP()
print("Yes"  if A*B % 2 == 1 else "No")

Submission status: Accepted

Solution code:
A, B = list(map(int,input().split()))
if (A*B) % 2 ==0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=[int(i) for i in input().split()]
if a%2==1 and b%2==1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

if (a*b)%2==0:
  print('No')
else:
  print('Yes')

Submission status: Accepted

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

if A % 2 == 0 or B % 2 == 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
def main():
    A, B = map(int, input().split())
    if A % 2 != 0 and B % 2 != 0:
        print("Yes")
    else:
        print("No")
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a == 2 or b == 2:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
print("Yes"if eval(input().replace(" ","*"))%2 else"No")

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
if A % 2 == 0 or B % 2 == 0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    a,b = map(int, input().split())
    if a==2 or b==2:
        print('No')
    else:
        print('Yes')
        

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def yn(P):
    if P:
        print("Yes")
    else:
        print("No")

a,b=map(int,input().split())
yn(a%2!=0 and b%2!=0)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
while True:
    if a*b*1 % 2 != 0:
        print("Yes")
        break

    elif a*b*2 % 2 != 0:
        print("Yes")
        break

    elif a*b*3 % 2 != 0:
        print("Yes")
        break

    else:
        print("No")
        break

Submission status: Accepted

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

if(a*b % 2 == 1):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
print("Yes"if eval(input().replace(' ','*'))%2==1 else "No")

Submission status: Accepted

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

if (a*b) % 2 == 0:
  print("No")
  
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A%2 == 0 or B%2 ==0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

if A*B%2 != 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import deque

sys.setrecursionlimit(10 ** 6)


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

A, B = map(int, input().split())
print('Yes' if any(A * B * C % 2 == 1 for C in range(1, 4)) else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

if (a*b)%2 == 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

    print('Yes' if (a*b)%2!=0 else 'No')

if __name__ == '__main__':
    main()

Submission status: Accepted

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

if a%2 != 0 and b%2 !=0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = "No"
for c in range(1,3):
    if a*b*c % 2 == 1:
        ans = "Yes"
        break

print(ans)

Submission status: Accepted

Solution code:
import sys

def main(lines):
  a, b = map(int, lines[0].split())
  if a % 2 != 0 and b % 2 != 0:
    print("Yes")
    return
  print("No")


if __name__ == '__main__':
    lines = []
    for l in sys.stdin:
        lines.append(l.rstrip('\r\n'))
    main(lines)

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
print('No' if a == 2 or b == 2 else 'Yes')

Submission status: Accepted

Solution code:
L = list(map(int,input().split()))
if 2 in L:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
if A%2 != 0 and B%2 != 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:


def solve():

    A, B = map(int, input().split())

    if (A*B) % 2 == 0:
        print("No")
    else:
        print("Yes")


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import math
import collections
import sys

#input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

a,b=MI()
if a==2 or b==2:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

if a%2 == 0 or b%2 == 0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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