Super Hypercube

Description

Above is a 4D hypercube. As you probably see, it is simply two 3D cubes with their corresponding vertices connected. Clearly, it has twice as many vertices as a 3D cube. Similarly a 5D hypercube is two 4D hypercubes with corresponding edges connected, and so on. Given $N$, determine the number of vertices in an $N$-dimensional hypercube.

Input

The first line contains a single integer $T$, denoting the number of test cases. $T$ lines follow, each with a single integer $N$. Note that $N$ may get very large.

Output

For each test case, print a line containing the number of vertices in an $N$-dimensional hypercube.

Sample Input

4
1
10
100
1000

Sample Output

2
1024
1267650600228229401496703205376
10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652624386837205668069376