CodeForces 598A 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 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.

Examples

Input

2
4
1000000000

Output

-4
499999998352516354

Note

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

主要是锻炼思维:

AC代码：

#include<stdio.h>
#include<math.h>
__int64 a[1009];
void dabiao()
{
	int i;
	a[0]=1;
	for(i=1;i<=50;i++)
	{
		a[i]=a[i-1]*2;
	}
}
int main()
{
	dabiao();
	__int64  n,s;
	int i,j;
	scanf("%I64d",&s);
	while(s--)
	{
        __int64 t;
        scanf("%I64d",&t);
        __int64  sum;
		sum=t*(t+1)/2;
        for(i=0;i<=30;i++)
        {
        	if(a[i]>t)
        	{
        	n=i;
			break;
            }
		}
		for(i=0;i<n;i++)
		{
			sum-=2*a[i];
		}
		printf("%I64d\n",sum);
	}
	return 0;
}