#include <bits/stdc++.h>
using namespace std;
vector primes;
void sieve(long long *p)
{
for (long long i = 2; i <= 500000; i++)
{
if (p[i] == 0)
{
primes.push_back(i);
for (long long j = i * i; j <= 500000; j = j + i)
{
p[j] = 1;
}
}
}
}
int main()
{
long long p[500000] = {0};
primes.push_back(0);
sieve(p);
int t;
cin >> t;
while (t--)
{
long long n;
cin >> n;
cout << primes[n] << endl;
}
}