There are n stones on the table. Two payers make moves alternatively. For each turn the player can take:
1 or 2 stones, if n is divisible by 3;
1 or 3 stones, if division by 3 gives the residue 1;
1, 2 or 3 stones, if division by 3 gives the residue 2.
Each move can be done only if there is sufficient quantity of stones. The player who can not make a move, lose a game.
One integer n (0 < n ≤ 100).
Print one number 1 or 2 - the number of the winning player in the case of optimal play.