## Introduction

A hypercube is a cube with more than 3 dimensions. A drawing of a 4 dimensional hypercube follows:

If you look closer, you can see that it is simply two 3D cubes with their corresponding vertices connected. Knowing this, it is easy to say that a 4D hypercube has twice as many vertices as a 3D cube. Similarly, a 5D hypercube is composed of two 4D hypercubes with corresponding vertices connected, and it has twice as many vertices as a 4D hypercube. Given this generalization, how many vertices are in an n-dimensional hypercube?

**Input :**

The first line of input contains an integer D, denoting the number of test cases. The next D lines each contain an integer n, denoting an n-dimensional hypercube. Assume that 4 ≤ n ≤ 60.

**Output:**

For each test case, output a line containing the number of vertices in the n-dimensional hypercube.

## Sample Input

```
4
4
8
11
20
```

## Sample Output

```
16
256
2048
1048576
```