# Problem D

Honeycomb Walk

Your program has to compute, for a given $n$, the number of different such larva walks.

## Input

The first line contains an integer giving the number of test cases to follow. Each case consists of one line containing an integer $n$, where $1\leq n\leq 14$.

## Output

For each test case, output one line containing the number of walks. Under the assumption $1\le n\le 14$, the answer will be less than $2^{31}$.

Sample Input 1 | Sample Output 1 |
---|---|

2 2 4 |
6 90 |