#include<bits/stdc++.h>
using namespace std;
#define ll long long int
void prime(ll *p)
{
ll i,j;
p[2]=1;
p[0]=p[1]=0;
for(i=3;i<=100000;i+=2)
p[i]=1;
for(i=3;i*i<=100000;i+=2)
{
if(p[i]==1)
{
for(j=i*i;j<=100000;j+=i)
p[j]=0;
}
}
}
int main()
{
ll p[100001]={0},k=0,i,j;
primeĀ§;
ll c[100001];
for(i=2;i<=100000;i++)
{
if(p[i]==1)
{
c[k]=i;
k++;
}
}
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
cout<<c[n-1]<<endl;
}
return 0;
}