#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > piii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];


int cal(ll x) {
    int res = 0;
    while (x) res++, x >>= 1;
    return res;
}

void solve() {
    ll n;
    cin >> n;
    int c = cal(n), mid = (c + 1) / 2, mid2 = (mid + 1) / 2;
    ll t = 0;
    for (int i = mid; i < c; i++) t += n & (1ll << i);
    ll ne = sqrtl(t);
    for (int i = mid - 1; i >= mid2; i--) {
        if ((ne >> i & 1) != (n >> i & 1)) {
            t += 1ll << i;
        }
        ne = sqrtl(t);
    }

    for (ll g = max(0ll, t - 35000); g <= t + 35000; g++) {
        if ((g ^ (ll)sqrtl(g)) == n) {
            printf("%lld\n", g);
            return;
        }
    }
    puts("-1");
}

int main() {
    int T;
    cin >> T;
    while (T--) solve();
    return 0;
}