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 modexp(base, exp, m):
   result = 1
   while exp:
      if exp % 2:
         result = (result * base) % m
      base      = (base   * base) % m
      exp /= 2
   return result

def process(N):
    # = .5 sum (k=1..N) { 2^k-1 (k) (k+1) }
    # = 2^N-1 (N^2-N+2) - 1
    return (modexp(2,N-1,8388608) * (N**2-N+2) - 1) % 8388608

def main():
    T = int(raw_input())
    for t in xrange(T):
        N = int(raw_input())
        print process(N)

main()