Problem Statement:
Consider a square matrix of order m(m rows and m columns). 
At each step you can move one step to the right or one step to the top.
 How many possibilities are there to reach (m,m) from (0,0)?
 
Input:
The first line consists of an integer t, the number of testcases.  Each testcase consists of a single integer m, the order of square matrix.
 
Output:
For each case print the number of possibilities of reaching the point (m,m) from (0,0)
 
Input Constraints:
1<=t<=10
1<=m<=14
Example:
Sample Input:
3
1
2
3
Sample Output:
2
6
20
Explanation of test case #2:

There are 6 possible ways of reaching (2,2) from (0,0)