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

vector<int> trans(ll n)
{
  vector<int> v(10, 0);
  while (n > 0)
  {
    v[n % 10]++;
    n /= 10;
  }
  return v;
}

void solve()
{
  int n;
  cin >> n;
  map<vector<int>, ll> mp;
  for (ll i = 0; i < 1e5; i++)
  {
    if ((i * i) > 1e9)
      break;
    auto p = trans(i * i);
    mp.insert({p, i * i});
  }
  for (int i = 0; i < n; i++)
  {
    ll num;
    cin >> num;
    auto p = trans(num);
    int k = p[0];
    for (int j = 0; j <= k; j++)
    {
      p[0] = j;
      if (mp.count(p) == 1)
      {
        cout << mp[p] << "\n";
        p[0] = -1000;
        j = k + 10;
      }
    }
    if (p[0] > -50)
      cout << "-1\n";
  }
}

int main()
{
  cin.tie(0)->sync_with_stdio(0);
  cout << fixed << setprecision(20);
  int CNT = 1;
  for (int i = 0; i < CNT; i++)
    solve();
}