Unique Paths in an NxN Grid

You are given an integer N representing the size of an N × N grid. Your task is to calculate the number of unique paths from the top-left corner to the bottom-right corner of the grid, where you can only move either down or right.

The answer can be computed by using the combinatorial formula:

\( \binom{2(N-1)}{N-1} \)

For example, if N = 3, the number of unique paths is:

\( \binom{4}{2} = 6 \)

Compute the result for each test case provided.

inputFormat

The first line contains an integer T which denotes the number of test cases. Each of the following T lines contains an integer N representing the size of the grid.

outputFormat

For each test case, output a single line containing the number of unique paths in the corresponding N × N grid.

## sample

3
2
3
4

2
6
20

</p>