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

using ll=long long;
map<ll,bool> mp;

void solve(){
  ll inf=1e18;
  string n;
  cin>>n;
  sort(n.begin(),n.end());
  ll ans=inf;
  do{
    ll x=stoll(n);
    if (mp[x]) ans=min(ans,x);
  }while(next_permutation(n.begin(),n.end()));
  if (ans==inf) cout<<-1<<endl;
  else cout<<ans<<endl;
}

int main(){
  for (ll i=0;i<1e6;i++) mp[i*i]=true;
  int t;
  cin>>t;
  while (t--) solve();
}