#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<vector>
#include<cstring>
#include<string>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<climits>
#include<iomanip>
#include<cassert>
using namespace std;
#define LL __int64
#define N 55
#define mod 10007
#define PI acos(-1)
const int INF=INT_MAX;
LL dp[N],a[N],n;
LL f(LL x)
{
    LL ans=0;
    int k;
    for(k=0;k<N;k++)
    if(a[k]==x) return dp[k];
    else if(a[k]>x) break;

    return dp[k-1]+f(x-a[k-1]-1)+x-a[k-1];
}
int main()
{
    a[0]=0;
    dp[0]=0;
    a[1]=1;
    dp[1]=1;

    for(int i=2;i<N;i++)
        a[i]=a[i-1]*2+1;
        //cout<<a[N-1]<<endl;
    for(int i=2;i<N;i++)
    dp[i]=dp[i-1]*2+a[i-1]+1;

    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%I64d",&n);
        printf("%I64d\n",f(n));
    }
    return 0;
}