Let G(S) denote the sum of the elements of set S and F(n) be the sum of G(s) for all subsets of the set consisting of the first n natural numbers. 

For example, F(3) = (1) + (2) + (3) + (1 + 2) + (1 + 3) + (2 + 3) + (1 + 2 + 3) = 24.



Given n, calculate F(1) + F(2) + ... + F(n).


Input

The first line contains the number of test cases T ( ≤ 1000). Each of the next T lines contains an integer n. (1 ≤ n ≤ 1000000000).

Output

Output T lines, one corresponding to each test case. Since the answers can get very big, output the answer modulo 8388608

Example

Input:
3
1
2
3
Output:
1
7
31
def fact (a):
    if a==0:
        return 1
    else:
        return a*fact(a-1)

def f( b):
    sum=0
    sum1=0
    for i in range(b):
        sum=sum+ fact(b-1)/(fact(i)*fact(b-i-1))
        sum1=sum1+i+1
    return sum1*sum

t=int(raw_input())
while(t):
    sum2=0
    n=int(raw_input())
    if(n<=22):

        for x in range(1,n+1):
         sum2=sum2+f(x)

        print sum2%8388608
    else :
        print 8388607
    t=t-1