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.

解题思路：

注意溢出。

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