tdkprime

#include<bits/stdc++.h>
using namespace std;
bool isprime[100000010];
vector <int> prime;
void seive()
{

    for(int i = 2 ; i*i <= 100000000 ; i++)
    {
        if(isprime[i] == false)
        {
            for(int j = i*2; j <= 100000000 ; j += i )
            {
                isprime[j] = true ;
            }
        }

    }
    prime.push_back(2);
    for(int i = 3 ; i <= 100000000 ; i += 2 )
    {
        if(isprime[i]== false)
            prime.push_back(i);
    }
}
int main()
{
    //freopen("/home/shohan/code/problem_solving/input.txt","r",stdin);
    int n;
    cin >> n;
    seive();
    int a[n];
    for(int i = 0 ; i < n ; i++)
        cin >> a[i];
    seive();
    //cout << prime.size()<< endl;
    //cout << prime[5000000];
    for(int i = 0 ; i < n ; i++)
    {
       // cout << a[i] << ' ';
        cout << prime[a[i]-1] << endl;
    }
    return 0;
}