#include <bits/stdc++.h>

using namespace std;

typedef __int128_t int128;
#define ll long long
#define int ll

int128 read(){
    int128 red=0, f_f=1; char c=getchar();
    while (c<'0'||c>'9'){if (c=='-')f_f=-1;c=getchar();}
    while (c>='0'&&c<='9'){red=(red<<1)+(red<<3)+(c^48);c=getchar();}
    return f_f*red;
}

const int N = 1e5+5;

int128 n, a, r, q;
int128 ans;

int128 calc(int128 x) {
    int128 re = x;
    while(x) {
        x >>= 1ll;
        re += x;
    }
    return re;
}

int128 find(int128 x) {
    int128 l = 1ll, r = 1e18, re = 0;
    while(l <= r) {
        int128 mid = (l+r)>>1ll, cc = calc(mid);
        if(cc == x) return mid;
        if(cc < x) re = mid, l = mid+1;
        else r = mid-1;
    }
    return re;
}

inline void write(int128 x) {
     if(x<0) putchar('-'),x=-x;
     if(x>9) write(x/10);
     putchar(x%10+'0');
}

void solve() {
    n = read();
    n--, ans=1, r=1, q=1;
    if(!n) {
        printf("1\n");
        return;
    }
    a = find(n);
    // printf("%lld\n", a);
    // return;
    ans += (n-calc(a))*(a+1);
    // printf("a--%lld %lld\n", a, calc(a));
    while(a) {
        ans += q*r*((a+1)/2)*((a+1)/2);
        r <<= 1ll, a >>= 1ll, q++;
    }
    write(ans);
    printf("\n");
}


signed main() {
    int128 T = read();
    while (T--) {
        solve();
    }
    return 0;
}