Sieve

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<30)
#define LINF (1LL<<60)
#define NINF -INF
#define CL(A,I) (memset(A,I,sizeof(A)))
#define add(A,B) (g[A].PB(B),g[B].PB(A))
#define ADD(A,B,V) (add(A,B),v[A].PB(V),v[B].PB(V))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
#define IN(n) int n; cin >> n;
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define PR(A,X) (X?A.second:A.first)
#define MX (86600000LL)
#define IS(A) ((cn[A>>6]>>(A&63))&1)
#define ST(A) (cn[A>>6]|=1ULL<<((A&63)))
int P[1<<23]={2},L(1);
ll cn[1<<23];
void gen(){
    ST(0),ST(1);
    int Q(1+sqrt(MX));
    for(int k(3);k<=Q;k+=2)if(!IS(k))
        for(ll h(k<<1),j(k*k);j<MX;j+=h)ST(j);
    for(int i(3);i<MX;i+=2)if(!IS(i))P[L++]=i;
}
int tt,N;
int main(void){
    gen();
    IN(tt)F(tt)scanf("%d",&N),printf("%d\n",P[N-1]);
    return 0;
}