Stones#5306
There are stones on the table. Two players take turns making moves. On each turn, a player can take:
or stones, if is divisible by ;
or stones, if divided by leaves remainder ;
, , or stones, if divided by leaves remainder .
A move can only be made if there are enough stones remaining. The player who cannot make a move loses the game.
The input consists of a single integer (0 < n \le 100).
Print a single integer or — the number of the player who will win if both play optimally.
Example 1