Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.
Problem hidden

PRIMECT - Generate Prime

The problem statement is simple, you have to write the nth prime number to the output.

Input

The first line contains the number of test cases,t.
Then t lines follow containing an integer n.

1<=t<=1000
1<=n<=664579

Output

The output contains t lines, each contains an integer, the answer for that particular value of n.

Example

Input:
2
3
10 Output: 5
29

Added by:`Ak
Date:2014-10-04
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 GOSU
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.