#include<bits/stdc++.h>
#define LL long long
#define LLL __int128
#define uint unsigned
#define ldb long double
#define uLL unsigned long long
using namespace std;
map<LL,LL>ans;
int a[20],f[100000];
inline bool chk(LL n){
    LL c=n%10;
    while(n/=10)if(n%10!=c)return 0;
    return 1;
}
inline void dfs(int x){
    if(x==5){
        vector<int>d;
        do{
            int x=0;for(int i=0;i<5;++i)x=x*10+a[i];
            d.emplace_back(x);
        }while(next_permutation(a,a+5));
        sort(a,a+5);
        for(auto i:d)for(auto j:d)
            if(to_string(i).length()>=to_string(j).length())
                f[i]=__gcd(f[i],j);
    }
    else for(int i=x?a[x-1]:0;i<10;++i)a[x]=i,dfs(x+1);
}
inline LL calc(LL n){
    LL h=n;
    int m=0;
    for(auto i:to_string(n))a[m++]=i&15;
    sort(a,a+m);
    do{
        LL x=0;for(int i=0;i<m;++i)x=x*10+a[i];
        h=__gcd(h,x);
    }while(next_permutation(a,a+m));
    return h;
}
inline void solve(LL n,LL c,int k){
    auto h=calc(n);
    if(!ans.count(h))ans[h]=n;
    else ans[h]=min(ans[h],n);
    if(n>1e17)return;
    solve(n*10+c,c,k);
    if(k)solve(n*10,c,0);
}
inline void init(){
    iota(f+1,f+100000,1);
    dfs(0);
    for(int i=1;i<100000;++i)
        if(!ans.count(f[i]))ans[f[i]]=i;
        else ans[f[i]]=min(ans[f[i]],1ll*i);
    for(int c=1;c<10;++c)solve(c,c,1);
}
inline void MAIN(){
    LL n;cin>>n;
    if(chk(n))cout<<n<<'\n';
    else cout<<(ans.count(n)?ans[n]:-1)<<'\n';
}
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    init();
    int t=1;cin>>t;while(t--)MAIN();
    return 0;
}
/*
*/