Description

As we all know, lls is the boss of SDNU ACM Training Team, so many team members may be afraid of him. But this is not the case, lls is very kindly to us. To show his love to us, he plan to give all of us an "Accepted". The problem shows as follows: There are n numbers $6^0,6^1,...,6^{n-1}$​.Each time you can choose a subset of them(may be empty), and then add them up.Count how many numbers can be represented in this way.

Format

Input

The first line of the input contains an integer T, denoting the number of test cases. In each test case, there is a single integers n in one line, as described above.
$1 \leq T \leq 20$, $0 \leq n \leq 1000$ ​

Output

For each test case, output one line contains a single integer, denoting the answer.

Samples

4
9
7
8
233

512
128
256
13803492693581127574869511724554050904902217944340773110325048447598592

Hints

The captain Albert_s is not tiger either :P  
![](http://www.acmicpc.sdnu.edu.cn/uploads/D8FF9AA4CB0EE30A463C6A6335A57EB6.jpg)