Educational Codeforces Round 1 A. Tricky Sum

A. Tricky Sum

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

In this problem you are to calculate the sum of all integers from 1 to n, but you should take all powers of two with minus in the sum.

For example, for n = 4 the sum is equal to  - 1 - 2 + 3 - 4 =  - 4, because 1, 2 and 4 are 20, 21 and 22 respectively.

Calculate the answer for t values of n.

Input

The first line of the input contains a single integer t (1 ≤ t ≤ 100) — the number of values of n to be processed.

Each of next t lines contains a single integer n (1 ≤ n ≤ 109).

Output

Print the requested sum for each of t integers n given in the input.

Sample test(s)

input

2
4
1000000000

output

-4
499999998352516354

Note

The answer for the first sample is explained in the statement.

题意：n = 4 时 -1-2+3-4 数是2^n的时为负数（1， 2， 4）。

先求前n项和(1+n)*n

在求前n项中2^n的和

详见代码

#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
        
        
#include