During the second congress of Paranoiac Informatics Society (called simply a meeting), all members took their places round a round table. One of the members posed the following question: "What is the number of ways we can shake our hands without leaving our places? Every participant can shake hand of one person and this person must be his/her neighbour."
Since the congress participants are theoreticians, they asked you to write a program, which computes this number of ways. The participants hate big numbers, so they need only the last digit of the result.
Task
Write a program, which:
- reads the number of congress participants from the standard input,
- computes the last digit of the number of ways the participants can shake hands,
- writes the answer to the standard output.
Input
The first and only line of the standard input contains one integer $n$ ($3 \le n \le 2\,000\,000\,000$), denoting the number of members.
Output
The first and only line of the standard output should contain one digit, i.e. the last digit of the number of ways the participants can shake hands.
Example
Input
4
Output
7
All possible ways of shaking hands.