题目都是浮云

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.

#include<stdio.h>
#include<math.h>
int main()
{
	int t;
	__int64 sum,n;
	scanf("%d",&t);
	while(t--)
	{int k;
	scanf("%I64d",&n);
	sum=n*(n+1)/2;//（先求前n项的和）
	for(int i=0;;i++)
	{
		if(pow(2,i)==n)
		{k=i;
		break;}
			if(pow(2,i)>n)
		{k=i-1;
		break;}//前n项中共有k项为负，将其化为以2为等比中项，以1为首项的等比数列
		
	}
	sum=sum-2*(pow(2,k+1)-1);
	printf("%I64d\n",sum);	
	}