数学

A - A 使用long long

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

Submit  Status

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 1, 2 and 4 are 2⁰, 2¹ and 2² 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 ≤ 10⁹).

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.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

#include<cstdio>
#include<cstdlib>
#include<cstring>
int main()
{	
	    int t;
		long long n;
	    scanf("%d",&t);
	    while(t--)
	 {
		scanf("%lld",&n);
		long long sum=0;
		for(int i=2;i<=n;i=i*2)
			sum+=i;
			long long sum1=(1+n)*n/2;
		//	printf("%lld ",sum1);
			long long sum2=sum1-sum*2-2;
		printf("%lld\n",sum2);
	 }
	return 0;
}