#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
	ll x;
	cin >> x;
	ll ans = 0;
	int lg = 0;
	while ((x >> lg)) lg ++;
	for (int d = 0; d < lg; d ++) {
		ans += ((x >> (d + 1)) << d);
		ans += max(0ll, (x & ((1ll << (d + 1)) - 1)) - (1ll << d) + 1);
	}
	cout << ans << endl;
}
int main () {
	int N;
	cin >> N;
	while (N--) solve();
}