#include<cstring>

 #include<cmath>

 #include<iostream>

 #include<algorithm>

 #include<cstdio>

 #define N 50007

 #define ll long long

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(ch<''||ch>''){if (ch=='-') f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=(x<<)+(x<<)+ch-'';ch=getchar();}

     return x*f;

 }

 int k;

 int tot,flag[N],mu[N],pri[N];

 void get_mu()

 {

     mu[]=;

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

     {

         if (!flag[i])pri[++tot]=i,mu[i]=-;

         for (int j=;j<=tot&&pri[j]*i<=N;j++)

         {

             flag[i*pri[j]]=;

             if (i%pri[j]==){mu[i*pri[j]]=;break;}

             else mu[i*pri[j]]=-mu[i];

         }

     }

 }

 bool check(int num)

 {

     int t=(int)sqrt(num);

     ll sum=;

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

         sum+=mu[i]*num/(i*i);

     return sum>=(ll)k;

 }

 int main()

 {

     get_mu();

     int T=read();

     while(T--)

     {

         k=read();

         ll l=k,r=;

         while(l<r)

         {

             ll mid=(l+r)>>;

             if (check(mid)) r=mid;

             else l=mid+;

         }

         printf("%d\n",l);

     }

 }