Dexter was hallucinating once. In his hallucination, he had to save a cat.
The cat was tied to the top-right corner of an NxN grid. One could only walk on the edges of the grid.
But, in the upper triangle of the grid, electric current was flowing along the edges. So, one could only use the edges in the lower triangle of the grid.

In order to unlock the cat, Dexter had to tell the number of ways he could reach from the bottom-left corner to the top-right corner of the grid if he could only move in the "up" and "right" direction.

The below image shows one of the ways to do so in a 4x4 grid:

Since Dexter was hallucinating, he couldn't solve the puzzle. You being his subconscious mind are trying to help him in solving the puzzle. Can you?

INPUT
The first line contains an integer T, denoting the number of test cases.
The next T lines contain an integer N, denoting the length of the sides of the NxN grid.

OUTPUT
Output the number of ways Dexter could reach from the bottom-left corner to the top-right corner following the edges in the lower triangle of the grid.

CONSTRAINTS
1 <= T <= 100
1 <= N <= 26