#include <cmath>
#include <ctime>
#include <string>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;

ll a[300000], num[300000];
int main(){
    int t;cin>>t;
  ll n;
    a[1]=1;num[1]=1;
    for(int i=2;i<=60;i++)
    { a[i]=a[i-1]*2ll+1ll+num[i-1];
     num[i]=num[i-1]*2ll+1ll;
    }
    ll m;
    while (cin>>n)
    {ll sum=0;ll k=0;
    //n=m;
    for(int i=60;i>=1;i--)
      { if(n>=num[i])
       {n=n-num[i];
        sum=sum+a[i]+num[i]*k;
        k++;
        if(n>=1) 
         { sum=sum+k;n--;}
         
       }
      }
        cout<<sum<<endl; 
    }
return 0;    
}