Time limit: 1 second
Memory limit: 256 MB
Postman is the best postman in the world! Therefore, he has been chosen to deliver Quera t-shirts to his winners.

In recent Quera tournaments,
n
n people have won t-shirts
n
n are the first people in the ranking of the site. This is Mr. Postman
n
n loaded the t-shirt to deliver to his winners; But suddenly Rodzyanko Dobromil Vyacheslavovich, who is a greedy lazy person, appeared in front of him. Radzinka took the postman to a corner to tell him a secret.

Apparently, Radzinka is the one who was responsible for delivering prizes to Quera winners before Mr. Postchi. He tells Mr. Postman about the strange winners of the Quera contest. In the past, Radzinka always went to the awards with empty pockets. (Mr. Postman is the same way, so he's very attracted to Radzinka's words.) This always happens when a prize is delivered to a winner: First, the winner asks how much money the prize-giver has with him. If the person who wins in Quera ranks
x
has x, is satisfied only when the amount of prize money is a natural multiple of
x
be x If at the beginning the amount of money with the bonus is a natural multiple of
x
was x, the winner receives his prize with satisfaction and takes it home. But if not, the punishment will begin. Person no
x
x takes the rewarder to a bank to withdraw some money and give it to him. (Even if the postman insists that he doesn't need to pay, the winning person won't owe!)

After going to the bank, if the awardee had 0 tomans of money with him, person no
x
x value
x
He pays him x tomans. Otherwise, he will take the smallest fraction of the present money from the bank and give it to him so that his money will be given to him.
x
Let x be divisible. (Because usually this amount is more than 200,000 Tomans, this operation takes a long time!)

After hearing these memories, Mr. Postchi starts to think. It doesn't matter to him the amount of money he receives; Only time matters to him. According to Radzinka's memoirs, the amount of time it takes Mr. Postman to deliver the packages is related to the number of times the winners take them to the bank, and this is related to the arrangement of the prizes.

For example, if
n
=
3
n=3 and Mr. Postman will give the prizes to rank 1 to 3 respectively, each of the 3 winners will take him to the bank. But if he first gets the prize to rank 2, then rank 1, and finally rank 3, people with ranks 2 and 3 will take him to the bank, and rank 1 won't take his time.

Mr. Postchi wants to understand the importance of this arrangement of people; So he wants to know that the difference in the number of going to the bank in the highest and lowest possible state (of all).
n
!
N! What is the possible order of awarding?

input
In the only input line of the number
n
n is said to represent the number of winners.

1
≤
n
≤
1
0
10
1≤n≤10
10


output
In the only output line, print a number that is equal to the difference of the number of banks in the highest and lowest possible state (of all).
n
!
N! possible order of awarding).

Example
Sample entry 1
3
Plain text
Sample output 1
1
Plain text
Sample input 2
1
Plain text
Sample output 2
0
Plain text
Sample entry 3
6
Plain text
Sample output 3
2