// USO (WA)

#include <bits/stdc++.h>
using ll = long long;

const ll width = 1001001;

ll isqrt(ll n){
    if (n == 0) return 0;
    ll x = std::sqrt(n) - 1;
    return (x * (x + 2) < n ? x + 1 : x);
}

void solve(){
    ll n; std::cin >> n;
    for (ll k = n-width; k <= n+width; k++){
        if (0 <= k){
            if (isqrt(k) ^ k ^ n) continue;
            std::cout << k << '\n';
            return ;
        }
    }
    std::cout << -1 << '\n';
}

int main(){
    int t; std::cin >> t;
    while (t--){
        solve();
    }
}