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

Examples

input

2
4
1000000000

output

-4
499999998352516354

题意：把所有数加起来，然后减去2^n，由于数据大，所以要用求和公式求1到n的和。

AC代码：

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