Guaranteed Win in Two-Pile Game

You are given two piles of stones with a and b stones respectively. Two players take turns removing stones. However, before the game starts, you must determine if you can guarantee a win based solely on the initial numbers.

The winning strategy is based on the parity of the sum of the stones in both piles. If the sum \(a+b\) is odd, you can guarantee a win, otherwise you cannot.

Note: The formula used is \((a+b) \bmod 2 \neq 0\).

inputFormat

The input consists of two integers a and b separated by a space, provided via standard input (stdin).

outputFormat

Output a single line containing 'Yes' if you can guarantee a win (i.e., (a+b) is odd), otherwise output 'No'. The output should be printed to standard output (stdout).## sample

7 6

Yes