Summing Subsets

Problem code: RESN05

All submissions for this problem are available.

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

Date: 2009-12-18
Time limit: 5s
Source limit: 50000
Languages: C C99 strict C++ 4.0.0-8 C++ 4.3.2 PAS gpc PAS fpc JAVA NICE JAR C# C#2 NEM ST ASM D FORT ADA BASH PERL PYTH RUBY LUA ICON PIKE PHP SCM guile SCM qobi LISP sbcl LISP clisp SCALA HASK ERL CAML CLPS PRLG WSPC BF ICK JS


Comments

I keep getting the Restricted

prsnk_Doesitmatter @ 20 Dec 2009 04:49 PM

I keep getting the Restricted content ..wtf  is this ??

Please login using

admin @ 20 Dec 2009 04:50 PM

Please login using resnk_oldid.

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

CodeChef is a global programming communityCodeChef hosts online programming competitions