#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all> 
using mint = atcoder::modint998244353;
#define int long long
signed main() {
  int T;
  cin >> T;
  vector<int> p(61,1);
  for(int i = 0; i < 60; i++) p[i+1] = p[i]*2;
  while(T--) {
    int n;
    cin >> n;
    int ans = 0;
    for(int i = 0; i < 50; i++) {
      int c = n/p[i+1];
      ans+=c*p[i];
      if(n%p[i+1] >= p[i]) ans+=n%p[i+1]-p[i]+1;
    }
    cout << ans << endl;
  }
}