Problem Statement:
Given N. You have to find S. Where S=2^{0}+2^{1}+2^{2}+...........+2^{N}
Input Format:
Input starts with an integer T (T ≤ 200,000), denoting the number of test cases, followed by the test cases. Each case is one line contains one integer N (1 ≤ N ≤ 10^{9}).
Output Format:
For each case, print S in a single line. Since S can be large so output S modulo 33,554,431.
Sample Input:
2
1
8
Sample Output:
3
511
Added by:

Alim14

Added at:

20140329 06:15:17 UTC

Time Limit:

3 seconds

Partial score:

No
