Game 1n (play1n)#9356
On a table in front of two players, there are identical items (such as buttons). The players take turns, and during each turn, they must take either one button or buttons from the table. Skipping a turn is not allowed. The winner is the player who forces their opponent to take the last button. Determine which player will win if both play optimally. 3 \leq n \leq 6, 1 \leq k \leq 100.
Provide the values and on a single line.
Print the number of the winning player.
Example 1