Time Limit:1000ms Memory Limit:65536KB


The main hall of UESTC is far from the dormitory. However, poor Hongshu has to go
there every day to talk with his teachers. This is the most unhappy thing on the
earth. However, Hongshu is so optimistic that he still digs a lot of fun during
that boring period.
There is a long flagstone walk on the way from the dormitory to the main hall.
This flagstone walk has N lines and four flagstones arranged in each line.
Hongshu always start from rightmost flagstone of the first line. In order to make
this walk funny, he would always step onto the left or right flagstone in the
next line if there is. For example, if Hongshu stands at the second rightmost
flagstone of the third line, he would choose to step to the first or third
rightmost one of the forth line. Note that Hongshu has only one choice when he is
at the corner of one line.
Because Hongshu has to go to the main hall every day, he wants to know how many
different ways to step across the flagstone walk. Can you help him?


The first line of the input is an integer T (T <= 20), which stands for the
number of test cases you need to solve.
Each case consists of an integer N (1 <= N <= 20) on a single line, which stands
for the length of the walk.


For each case, print the number of ways on a single line.

Sample Input


Sample Output



Hongshu has 3 ways to choose when the length of walk is 4.



The 8th UESTC Programming Contest Preliminary