# CodeForces 598A Tricky Sum

Q - Q
Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

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 12 and 4 are 2021 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 Input

Input
2
4
1000000000

Output
-4
499999998352516354


Hint

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

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
__int64 t,i,n,sum;
scanf("%I64d",&t);
while(t--)
{
sum=0;
scanf("%I64d",&n);
sum=n*(n+1)/2;
for(i=1;i<=n;i=i*2)
{
sum=sum-2*i;
}
printf("%I64d\n",sum);
}
return 0;
}

#### 【Codeforces 598A】 Tricky Sum

2016-07-24 21:47:26

#### codeforces 598A Tricky Sum

2016-07-21 23:06:58

#### 【CodeForces - 598A】Tricky Sum

2017-07-30 11:04:27

#### (CodeForces - 598A)Tricky Sum

2017-09-07 07:55:35

#### 【CodeForces】[598A]Tricky Sum

2016-04-07 13:33:47

#### 【CodeForces】598A - Tricky Sum

2017-08-14 16:34:38

#### Codeforces 598A Tricky Sum 【计数】

2015-11-15 18:27:27

#### 【CodeForces 598A】Tricky Sum（计数）

2016-04-02 19:25:47

#### Codeforces 598A Tricky Sum【计数】

2016-08-20 03:35:26

#### CodeForces - 598A A. Tricky Sum

2017-07-25 09:35:35