#include <bits/stdc++.h>
using namespace std;

#define For(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, n) For(i, 0, n)
#define rFor(i, a, b) for(int i = (a); i >= (b); i--)
#define ALL(v) (v).begin(), (v).end()
#define rALL(v) (v).rbegin(), (v).rend()

using lint = long long;
using ld = long double;

int INF = 2000000000;
lint LINF = 1000000000000000000;

struct SetupIo {
    SetupIo() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(15);
    }
} setupio;

// [l, r) に i 番目のビット (2^i) が立っている数はいくつあるか
long long range_bit(long long l, long long r, long long i) {
   // [0, x)
   auto internal = [&](long long x) -> long long {
       long long len = (1LL << (i + 1LL));
       long long half = (1LL << i);
       long long quo = x / len, rem = x % len;
       long long res = half * quo;
       if (rem > 0) {
           rem--;
           res += max(0LL, rem - half + 1LL);
       }
       return res;
   };
   return internal(r) - internal(l);
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        lint n;
        cin >> n;
        lint ans = 0;
        rep(i, 63) {
            ans += range_bit(1, n + 1, i);
        }
        cout << ans << "\n";
    }
}