In the lower left corner of an M \times N board, there is a queen. Two players take turns moving the queen, each moving it any number of cells vertically upwards, horizontally to the right, or diagonally to the right and upwards.
The winner is the player who moves the queen to the top right corner of the board. Determine which player has a winning strategy.
The input contains two natural numbers and (1 \leq M, N \leq 100).
Print the number of the player ( or ) who has a winning strategy.
Example 1