#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,ll> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;
const int MAXN=3*1000000;

ll solve(){
    ll N;
    cin>>N;
    N++;
    ll ans=0;
    for(int k=0;k<60;k++){
        ll c=N/(1LL<<(k+1));

        ans+=c*(1LL<<k);
        ll r=N%(1LL<<(k+1));
        r-=(1LL<<k);

        ans+=max(0LL,r);
    }
    return ans;

}

int main(){
    int T;
    cin>>T;
    vector<ll> ans(T);
    for(int t=0;t<T;t++){
        ans[t]=solve();
    }
    for(int t=0;t<T;t++){
        cout<<ans[t]<<endl;
    }
}