B - Tricky Sum

点击打开链接

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.

Example

Input

2
4
1000000000

Output

-4
499999998352516354

Note

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

提交了好多次，只要输入大的数就不对，才发现把范围开小了！！！

写的不是特别简短，但明白意思就ok;

代码：

#include<stdio.h>
int p[1000000];
int main()
{int t;
scanf("%d",&t);
while(t--)
{
long long  n,x,y,i,sum1=0,ans;
scanf("%lld",&n);
long long sum=1;
p[0]=1;
for( i=1;;i++)
{
sum=sum*2;
p[i]=sum;
    if(sum>n)
    break;
    }
    y=n*(n+1)/2;
for(int j=0;j<i;j++)
sum1=sum1+p[j];
ans=y-2*sum1;
printf("%lld\n",ans);
}
 return 0;
}