Problem Description

There are two piles of coins: one with $A$ coins and another with $B$ coins. Alice and Bob will play a game using these two piles.

Alice starts first, and the two players alternate taking the following actions:

• Choose one pile with at least one coin. Let $X$ be the number of coins in that pile.
• Then, remove $0$ or more coins from each of the two piles.
• However, the total number of coins removed must be equal to $X$.

The game ends when there are no coins left in any pile, and the player who made the last move wins.

Determine if Alice will win if both players play optimally.

Input Format

The input is given from the standard input in the following format:

$A$ $B$

Output Format

Output Yes if Alice wins, otherwise output No.

Sample Input and Output

Sample Input #1

2 2

Sample Output #1

Yes

Sample Input #2

3 3

Sample Output #2

No

Notes/Hints

Constraints

• $1 \leq A \leq 10^5$
• $1 \leq B \leq 10^5$
• All inputs are integers.

Sample Explanation 1

If Alice takes one coin from each pile, making it $(1, 1)$, Bob can only take one coin from either pile, resulting in $(1, 0)$. Alice then takes the remaining coin and wins.

见题面 Input 部分

见题面 Output 部分