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
from math import *

def fast_exponentiation(base, n):
  if n == 1:
    return base
  else:
    if n % 2 == 0:
      base1 = fast_exponentiation(base, n/2)**2
      return base1%8388608
    else:
      return (base*fast_exponentiation(base,(n-1)/2)**2)%8388608

t = int(raw_input())
i = 0
while i < t:
    x = int(raw_input())
    if x == 1:
        print 1
        i+=1
    else:
        print (fast_exponentiation(2,x-1)*x**2-fast_exponentiation(2,x-1)*x + fast_exponentiation(2,x)-1)%8388608
        i+=1