count total set bits

/*
You are given a number N. Find the total count of set bits for all numbers from 1 to N(both inclusive).

Input:
The first line of input contains an integer T denoting the number of test cases. T testcases follow. The first line of each test case is N.

Output:
For each testcase, in a new line, print the total count of all bits.

Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 103

Example:
Input:
2
4
17
Output:
5
35

Explanation:
Testcase1:
An easy way to look at it is to consider the number, n = 4:
0 0 0 = 0
0 0 1 = 1
0 1 0 = 1
0 1 1 = 2
1 0 0 = 1
Therefore , the total number of bits is 5.
*/

#include <bits/stdc++.h>
using namespace std;


int main() {
	int t; cin>>t; while(t--)
	{
	    int n;
    cin>>n;
     int Count=0,Sum=0;
    for(int j=1;j<=n;j++)
    {
         int i=0;
         Count=0;

    while(j>=(1<<i))
    {
      int  num=j|(1<<i);
        if(num==j)
            Count++;
    i++;

    }
Sum=Sum+Count;
}
cout<<Sum<<endl;
	}
	return 0;
}