#include<stdio.h>
#include<algorithm>
#include <iostream>
#include <algorithm>
#include <queue>
#define LL long long
using namespace std;

const int MAXN = 110;
const LL BigNum = 1e16;

LL a[MAXN], sum[MAXN];

LL Solve(LL N)
{
    if(N == 0)
        return 0;
    int pos;
    for(int i=1; i<MAXN; i++)
    {
        if(a[i+1] > N)
        {
            pos = i;
            break;
        }
    }
    if(a[pos] == N)
        return sum[pos];
    else
        return sum[pos] + Solve(N-a[pos]-1) + N - a[pos];
}

int main()
{
    a[1] = 1, sum[1] = 1;
    for(int i=2; i<MAXN; i++)
    {
        a[i] = a[i-1] * 2 + 1;
        sum[i] = sum[i-1] * 2 + a[i-1] + 1;
        if(a[i] > BigNum)
            break;
    }
    int T;
    scanf("%d", &T);
    while(T--)
    {
        LL N, ans;
        cin>>N;
       
        cout<<Solve(N)<<endl;
    }

    return 0;
}