Parovi
Mirko and Slavko are playing a game. Mirko’s turn is first and he chooses a nonempty set of pairs of numbers between $1$ and $N$ (inclusive) under the condition that the numbers that comprise a pair are mutually relatively prime. The numbers that comprise a pair must be different. For example, for $N = 5$, Mirko could have chosen the following set of pairs: $\{ \{ 1, 2\} , \{ 3, 4\} , \{ 2, 5\} , \{ 3, 5\} \} $.
Slavko’s turn is second and his goal is to find a partition for Mirko’s set of pairs. Mirko’s set of pairs has a partition if an integer $x$ from the set $\{ 2, 3, \ldots , N \} $ exists such that, for each pair $\{ a, b\} $, one of the following holds:

$a, b < x$

$a, b \geq x$
For example, a set of pairs $\{ \{ 1, 2\} , \{ 3, 4\} \} $ has a partition $x = 3$. If a partition exists, Slavko will surely find it.
Mirko wins if Slavko can’t find a partition for his set. Determine how many different sets of pairs exists that Mirko can initially choose and be sure of his victory. Given the fact that the total number of sets can be very large, output the number modulo $1\, 000\, 000\, 000$.
Input
The first line of input contains the integer $N$ ($1 \leq $N$ \leq 20$).
Output
The first and only line of output must contain the required number.
Sample Input 1  Sample Output 1 

2 
1 
Sample Input 2  Sample Output 2 

3 
5 
Sample Input 3  Sample Output 3 

4 
21 