Akash is naughty playboy. But today, he got selected for ATF Camp and he is a super happy soul.

There are exactly $N$ days left before he will join ATF camp. Coincidently, he also has exactly $N$ girlfriends. So, Akash plans to spend exactly one day with each of his girlfriends. You are jealous knowing about his plans, so to divert yourself, you focus on finding the number of ways Akash can plan his visits to his $N$ girlfriends.

Example: Let's say Akash has to visit 3 girlfriends: A, B, C on 3 days. There are exactly 6 ways he can plan his trip:

First Line: Integer $T$ denoting number of test cases.

Each of Next $T$ lines have one integer $N$, which denotes the number of days and the number of girlfriends Akash is planning to visit.

Constraints

$1 \leq T \leq 10$

$1 \leq N \leq 10$

For each test case, print the number of ways Akash can plan his trip as described in the problem statement.

The answer to each test case must be printed in a new line.