The question is so easy. Now the leader have met N students. And all their questions are different.
Now the leader forgot the right sequence of them, he needs your help to find how many kinds of situations which linking their names to their words will be that nobody's name is linked to his own word (For example, the Kth student will ask Kth question, so every situation should be that Kth question can not be linked to Kth student).
Input until EOF.
Each test contains one integer N(2<=N<=12).
Output the number of situations that nobody's name is linked to his own word.