DCEPC505 - Bazinga!

no tags 

Sheldon is very proud of his intelligence. To test his intelligence Howard designs a puzzle and asks him to solve it. The puzzle consists of special numbers which can be obtained by multiplying exactly two distinct prime numbers. Sheldon has to tell Howard what is the Kth element of this series. Help him.

For Example 6, 10, 14, 15 are theĀ first few membersĀ of this series whereas 4, 9 and 12 are not.

Input

First line specifies T, the number of test cases.

Next T lines each gives 1 number, K

Output

Output 1 line for each test case giving the Kth element of this series.

Constraints

1 <= T <= 1000

1 <= K <= 2000000

Example

Input:
4
2
3
5
7

Output:
10
14
21
26

hide comments
Francky: 2012-05-13 20:40:18

Please open to all languages. Why those restrictions ? I would like to submit in Python.

Ehor Nechiporenko: 2012-05-07 14:42:55

10527449

[Retired] Fendy Kosnatha: 2012-04-29 18:11:42

what is the answer for K=2000000??


Added by:dce coders
Date:2012-04-18
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:Own Problem