#include <bits/stdc++.h>

using namespace std;

int32_t main() {
  cin.tie(0) -> sync_with_stdio(0);
  const int N = 2e5 + 1, INF = 1e9;
  vector<int> dp(N, INF);
  dp[0] = 0;
  for (int i = 1; i * i <= N; i++) {
    for (int j = N - 1; j >= 1; --j) {
      if (j >= i * i) {
        dp[j] = min(dp[j], dp[j - i * i] + 1);
      }
    }
  }
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    cin >> n;
    cout << (dp[n] == INF ? -1 : dp[n]) << "\n";
  }
  return 0;
}