#include <iostream>
#include <algorithm>
using namespace std;

int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	int T;
	cin >> T;
	long long dp[58];
	dp[0] = 1;
	for (int i = 1; i <= 57; i++) {
		dp[i] = dp[i - 1] * 2 + (1LL << i) / 3;
	}
	for (int testcase = 1; testcase <= T; testcase++) {
		long long N;
		cin >> N;
		long long answer = 0;
		while (N != 0) {
			int level = 63 - __builtin_clzll(N);
			N -= (1LL << level);
			answer += dp[level] + min(N, (2LL << level) / 3);
		}
		cout << answer << '\n';
	}
	return 0;
}