#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n;
  cin >> n;
  ll l = 0, r = n, ans = 0;
  for (ll i = 62; i >= 0; i--) {
    r -= n & (1ll << i);
    l <<= 1;
    l += (n >> (i + 1)) & 1;
    ans += l * (1ll << i) + (r + 1) * ((n >> i) & 1);
  }
  cout << ans << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  cin >> T;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}