FKMO 2014 Problem 3

There are $n$ students sitting on a round table. You collect all of $n$ name tags and give them back arbitrarily. Each student gets one of $n$ name tags. Now $n$ students repeat following operation: The students who have their own name tags exit the table. The other students give their name tags to the student who is sitting right to him. Find the number of ways giving name tags such that there exist a student who don't exit the table after 4 operations.