4 人解决，10 人已尝试。
5 份提交通过，共有 12 份提交。
8.2 EMB 奖励。
1683. Honeycomb Walk
单点时限: 2.0 sec
内存限制: 256 MB
A bee larva living in a hexagonal cell of a large honeycomb decides to creep for a walk. In each “step” the larva may move into any of the six adjacent cells and after n steps, it is to end up in its original cell.
Your program has to compute, for a given n, the number of different such larva walks.
输入格式
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 ≤ n ≤ 14.
输出格式
For each test case, output one line containing the number of walks. Under the assumption 1 ≤ n ≤ 14, the answer will be less than 2^31.
样例
Input
2 2 4
Output
6 90
题目标签