### Problem

Venn diagram is a schematic diagram used in logic theory to depict
collections of sets and represent their relationships. However, the
expressive power of venn diagram can be strongly restricted when
only circles are used to represent sets.
In this problem, you are to write a program, given the number of
sets ,
to decide the maximum number of distinct possibilities that can be illustrated using venn diagram with circles.
For example, when ,
only two possibilities can arise at most.
While ,
there can be 4 possibilities altogether,
say ,
where
means set minus. The cases of
and
are shown in the figure below:

### Input

The first line of input contains the number of test cases that follow.
For each test case there will be a line with an non-negative
integer
as described above.

### Output

For each line of input except the first line, output the
corresponding maximum on a single line.

### Sample Input

3
1
2
3

### Sample Output

2
4
8

**Author: ***hewei*