PROGRAMMING:courtesy requires a return of visits received

Jigo is the same jigo, who is called "Jiji" in the world. Whenever the festival comes, Jiji, who has many girlfriends, can always receive all kinds of gifts from girlfriends all over the country. It's a pleasure to receive a gift, but it's a trouble to return it! No matter how troublesome it is, I'm always embarrassed to accept a gift without returning it. That's not Jiji's style. Now, Jiji, who loves face and is stingy, has come up with a wonderful way: he is ready to distribute the gifts sent by his girlfriends reasonably, and then send them back to different girlfriends, so that he doesn't have to spend money to buy gifts any more! Suppose that each of his n girlfriends gives him a gift (the gift given by each of them is different). Now he needs to make reasonable arrangements to send back a gift to each of his girlfriends. The key point is that the gift returned can't be the gift given to him by his girlfriends before. Otherwise, he will be involved in a big event... Now, Jijigo wants to know how many kinds of gift return schemes meet the conditions?
###Input format:
The first line of input data is a positive integer T, indicating that there are t groups of test data (T < = 100);
Each group of data contains a positive integer n, which means that the number of girlfriends is n (1 < = n < = 100).
###Output format:
Please output the number of possible schemes, because the number of schemes may be large. Please modulus the result to 1000000007 before output（ Tip: in the process of recursion, it is necessary to constantly seek redundancy to prevent data overflow due to too large data.)
Each output occupies one line.
###Input example:
```in
three
one
two
four
```
###Output example:
```out
0
one
nine
```







answer：If there is no answer, please comment