#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(int)(n); i++)

struct SumCount{ u64 sum = 0; u64 cnt = 0; };
SumCount& operator += (SumCount& l, SumCount r){ l.sum += r.sum; l.cnt += r.cnt; return l; }
SumCount& operator += (SumCount& l, u64 r){ l.sum += l.cnt * r; return l; }

SumCount dp0[61][8];
SumCount dp[61][8];

int main(){
    dp0[0][0].cnt = 1;
    auto add0 = [&](SumCount* l, SumCount* r){
        for(int q=0; q<8; q++){
            if(q == 0b1011) l[0b110] += r[0b011];
            else l[q/2] += r[q%8];
        }
        l[0b010].sum += r[0b100].cnt;
        l[0b010].sum += r[0b101].cnt;
    };
    auto add1 = [&](SumCount* l, SumCount* r){
        for(int q=8; q<16; q++){
            if(q == 0b1011) l[0b110] += r[0b011];
            else l[q/2] += r[q%8];
        }
        l[0b110].sum += r[0b100].cnt * 2;
        l[0b110].sum += r[0b101].cnt * 2;
        l[0b110].sum += r[0b011].cnt;
    };
    rep(d,60){
        add0(dp0[d+1], dp0[d]);
        add1(dp0[d+1], dp0[d]);
    }
    int T; cin >> T;
    rep(i,T){
        u64 N; cin >> N; N++;
        rep(c,61) rep(q,8) dp[c][q] = {};
        rep(d,60){
            int c = (N>>(d))&1;
            if(c){
                add1(dp[d+1], dp[d]);
                add0(dp[d+1], dp0[d]);
            }
            else{
                add0(dp[d+1], dp[d]);
            }
        }
        u64 ans = dp[60][0].sum;
        cout << ans << '\n';
    }
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;