#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 2000000000000000001



int main(){
	
	int _t;
	cin>>_t;
	
	rep(_,_t){
		
		long long N;
		cin>>N;
		
		vector dp(2,vector(60,vector<long long>(60,0)));
		dp[0][0][2] = 1;
		
		for(int i=59;i>=0;i--){
			vector ndp(2,vector(60,vector<long long>(60,0)));
			rep(j,2){
				rep(k,60){
					rep(l,60){
						if(dp[j][k][l]==0)continue;
						
						rep(m,2){
							int nj = j,nk = 59,nl = 59;
							
							if(j==0 && ((N>>i)&1)==0 && m==1)continue;
							if(((N>>i)&1) && m==0)nj = 1;
							if(m==0){
								nk = min(nk,k);
								nl = min(nl,l+1);
								nk = min(nk,l);
							}
							else{
								nk = min(nk,k+1);
								nl = min(nl,l);
								nl = min(nl,k+2);
							}
							
							ndp[nj][nk][nl] += dp[j][k][l];
						}
						
						
					}
				}
			}
			swap(dp,ndp);
			
		}
		
		long long ans = 0;
		rep(i,2){
			rep(j,60){
				rep(k,60){
					//if(dp[i][j][k])cout<<i<<','<<j<<','<<k<<endl;
					
					ans += dp[i][j][k] * (long long) min(j,k);
				}
			}
		}
		
		cout<<ans<<endl;
		
	}
	
    return 0;
}