#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cstdlib>

 #include<cmath>

 #include<iostream>

 using namespace std;

 typedef long long ll;

 ll t,n;

 inline ll read(){

     char k=;char ls;ls=getchar();for(;ls<''||ls>'';k=ls,ls=getchar());

     ll x=;for(;ls>=''&&ls<='';ls=getchar())x=(x<<)+(x<<)+ls-'';

     if(k=='-')x=-x;return x;

 }

 //莫比乌斯函数线性筛法

 const int maxn=+;

 bool vis[maxn];

 int prime[maxn],mu[maxn];

 void init_mu(int n){

     int cnt=;

     mu[]=;

     for(int i=;i<n;i++){

         if(!vis[i]){

             prime[cnt++]=i;

             mu[i]=-;

         }

         for(int j=;j<cnt&&i*prime[j]<n;j++){

             vis[i*prime[j]]=;

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

             else { mu[i*prime[j]]=-mu[i];}

         }

     }

 }

 bool check(ll x){

     ll ans=;

     for(ll i=;i*i<=x;i++){

         ans+=mu[i]*(x/(i*i));

     }

     return ans>=n;

 }

 ll erfen(ll l,ll r){

     while(l<r){

         ll mid=(l+r)>>;

         if(check(mid)) r=mid;

         else l=mid+;

     }

     return r;

 }

 int main(){

     init_mu();

     t=read();

     while(t--){

         n=read();

         printf("%lld\n",erfen(, ));

     }

 }