In the bottom-left corner of an m \times n board, there is a king. Two players take turns moving the king. The king can move one square either vertically upwards, horizontally to the right, or diagonally to the right and upwards. The player who cannot make a move loses the game. Your task is to determine which player has a winning strategy.
The input consists of two natural numbers, and , each not exceeding 10^9.
The output should be the number of the player ( or ) who has a winning strategy.
Example 1