#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int a[1000][1000];
ll ans[1000];


ll fun(ll x) {
    if (x <= 100) return ans[x];
    ll tmp = 1;
    for (; tmp<x; tmp*=2);
    tmp /= 2;

    return fun(x-tmp)*2;
}



void solve()
{
    ll n;
    scanf("%lld", &n);
    printf("%lld\n", fun(n));
}




int main()
{
    a[1][1] = ans[1] = 1;
    for (int i=2; i<=100; i++) {
        a[i][1] = a[i][i] = 1;
        for (int j=2; j<i; j++) a[i][j] = a[i-1][j-1]^a[i-1][j];
        for (int j=1; j<=i; j++) a[i][0] += (a[i][j]==1);
        ans[i] = a[i][0];
    }
    int ttt;
    scanf("%d", &ttt);
    while (ttt--) {
        solve();
    }
    return 0;
}