#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl "\n"

void solve() {
    unsigned long long n;
    cin >> n;
    n--;

    unsigned long long result = 0;
    unsigned long long bit_length = 0;

    // Determine the bit length of the number
    if (n == 0) bit_length = 1;
    else bit_length = log2(n) + 1;

    for (int i = 0; i < bit_length; i++) {
        if (i % 2 == 0) {
            // Set even-indexed bits to 0 (already 0 in result, so no need to do anything)
        } else {
            // Flip odd-indexed bits: If the original bit is 1, set it to 1; if 0, set it to 0
            if ((n & ((unsigned long long)1 << i)) == ((unsigned long long)1<<i)) { // If the bit is 0, set it to 1 in result
                result += ((unsigned long long)1 << i);
            }
        }
    }

    cout << result + 1 << endl;
}

int main() {
    //fast;
    freopen( "biscuits.in", "r", stdin );
    freopen( "biscuits.out", "w", stdout );
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}