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

using ll = long long;
#define rep(i, a, n) for(int i = a; i < n; i++)

int main() {
	int T;
	cin >> T;
	ll n = 1e10;
	map<vector<int>, int> mp;
	for(ll i = 1; i * i < n; i++) {
		int sq = i * i;
		vector<int> c(10);
		while(sq) {
			int d = sq % 10;
			c[d]++;
			sq /= 10;
		}
		if(mp.count(c)) mp[c] = min(mp[c], sq);
		else mp[c] = sq;
	}
	rep(ti, 0, T) {
		int N;
		cin >> N;
		int INF = 1e9 + 1;
		vector<int> c(10);
		while(N) {
			int d = N % 10;
			c[d]++;
			N /= 10;
		}
		int ans = INF;
		int r = c[0] + 1;
		rep(i, 0, r) {
			if(mp.count(c)) {
				ans = min(ans, mp[c]);
				c[0]--;
			}
		}
		if(ans == INF) ans = -1;
		cout << ans << endl;
	}

}