#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define MAX 128
#define X first
#define Y second

using namespace std;

typedef long long i64;
typedef pair<int, int> Pii;

i64 s[MAX], l[MAX];

void Init() {
  memset(s, 0, sizeof(s));
  memset(l, 0, sizeof(l));
  s[1] = 1; l[1] = 1;
  for (int i = 2; i < 60; ++i) {
    s[i] = 2 * s[i - 1] + l[i - 1] + 1;
    l[i] = 2 * l[i - 1] + 1;
  }
}

i64 Solve(i64 n) {
  if (n <= 0) return 0;
  if (n == 1) return 1;
  int p = upper_bound(l + 1, l + 60, n) - l - 1;
  return s[p] + (n - l[p]) + Solve(n - l[p] - 1);
}

int main() {
  Init();
  int t;
  cin >> t;
  while (t--) {
    i64 n;
    cin >> n;
    cout << Solve(n) << endl;
  }
  return 0;
}