#include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 const int maxn=1e6+;

 int t,n;

 int min_num[maxn],cnt[maxn];

 int main(){

     memset(min_num,-,sizeof(min_num));

     for(int i=;i<maxn;i++)

         for(int j=i;j<maxn;j+=i)

             cnt[j]++;

     for(int i=;i<maxn;i++)

         if(min_num[cnt[i]]==-)

             min_num[cnt[i]]=i;

     scanf("%d",&t);

     while(t--){

         scanf("%d",&n);

         printf("%d\n",min_num[n]);

     }

     return ;

 }