#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

const int N = 2e5 + 3, inf = 1e9;
vector<int> dp(N, inf);

void solve() {
    int x;
    cin >> x;
    if(dp[x] < inf) cout << dp[x] << endl;
    else cout << -1 << endl;
    return;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int sq = 1;
    vector<int> psq;
    dp[0] = 0;
    while(sq * sq < N) psq.pb(sq * sq), dp[sq * sq] = 1, sq++;
    // cout << psq.size() << " = "; coutall(psq);
    for(int i = 0; i < psq.size(); i++) {
        for(int w = N - 1; w >= 2; w--) {
            if(psq[i] > w) break;
            if(w - psq[i] < psq[i]) dp[w] = min(dp[w], 1 + dp[w - psq[i]]);
        }
    }

    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}