#include<iostream>
#include<cstdio>
#include<algorithm>>
#include<cstring>
#include<cmath>
using namespace std;
#define LL long long
const int maxn = 100050;
///LL inf = 1e18;
LL solve(LL x)
{
    LL ans = 0;
    while(x>0){
        LL k = 0;
        while((1LL<<k+1)-1<=x)k++;
        ans+=k*(1LL<<k-1) + x-((1LL<<k)-1);
        x = x-((1LL<<k)-1)-1;
    ////cout << ans <<endl;
    }
    return ans;
}
int main()
{
    int T;
    LL n,ans;
    ///freopen("in.txt","r",stdin);
    scanf("%d",&T);
    while(T--){
        scanf("%I64d",&n);
        ans = solve(n);
        printf("%I64d\n",ans);
    }
    return 0;
}