#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <set>
#include <list>
#include <queue>
#include <map>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-4
#define maxn 100010
#define N 100000
long long s(int k)
{
    return (1ll <<(k+1)) - 1;
}
long long sum[110];
long long solve(long long m)
{
    if(m == 1)
        return 1;
    if(m <= 0)
        return 0;
    long long mm = m+1;
    int k = -2;
    while(mm)
    {
        mm >>= 1;
        k++;
    }
    mm = m - (1ll<<(k+1)) + 1;
    return sum[k] + mm + solve(mm-1);
}
int main()
{
    sum[0] = 1;
    for(int i = 1; i < 101; i++)
        sum[i] = sum[i-1]*2 + s(i) - s(i-1);
    int t;
    scanf("%d",&t);
    while(t--)
    {
        long long m;
        scanf("%I64d",&m);
        printf("%I64d\n",solve(m));
    }
    return 0;
}