#include <bits/stdc++.h>
using namespace std;

#define int long long

using vi=vector<int>;
using vvi=vector<vector<int>>;
using vvvi=vector<vector<vector<int>>>;
using vs=vector<string>;
using mai=map<int,int>;
using sei=set<int>;
using sti=stack<int>;
using qui=queue<int>;

#define rep(i,x) for(int i=0;i<(int)x;i++)
#define rept(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()

const double PI=3.141592653589793;
const int INF=1LL<<60;

template<typename T> void printv(vector<T> x){rep(i,x.size())cout<<(i!=0?" ":"")<<x[i];cout<<'\n';}
template<typename T> void printvv(vector<vector<T>> x){rep(i,x.size())printv(x[i]);}

int solve(int n){
	int ans=0;
	for(int i=1;i<=1e13;i*=2) ans+=(n/i)/2*i+max(0LL,n%(i*2)-i);
	return ans;
}

signed main(){
    int t;cin>>t;
    rep(_,t){
    	int n;cin>>n;
    	cout<<solve(n+1)<<endl;
    }
}