H. Men's showdown
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Once, a big debate broke out in Room $$$113$$$: which of the two students will go to wipe out the board? The problem began to be solved in a manly way! There is a box with $$$N$$$ crayons in this room. Each student in turn takes $$$1$$$, $$$5$$$, or $$$13$$$ crayons. Everything is extremely simple: the student after whose move there are no crayons left will go to wipe the board covered with formulas. Both students make their moves optimally.

Who will win this fight and not wipe out the ill-fated board?

Input

The first line introduces the number $$$N$$$ — the number of crayons in Room $$$113$$$ $$$(1 \le N \le 10000)$$$.

Output

Type the number (№) of the player who wins.

Examples
Input
4
Output
1
Input
5
Output
2