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