CF598A.Tricky Sum

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

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^{0}$ , $2^{1}$ and $2^{2}$ respectively.

Calculate the answer for $t$ values of $n$ .

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^{9}$ ).

Print the requested sum for each of $t$ integers $n$ given in the input.

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