DCEPC505 - Bazinga!

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

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

hide comments
2014-06-10 23:49:14 Rishav Goyal
i can't beliveve ac after so many tle :D :D:
2014-02-13 21:56:13 Mostafa 36a2
OverFlow :)
2014-01-06 20:56:51 anurag garg
took 3 hours to determine the bounds and 1 hour to remove Sigsegv error...finally AC
2014-01-05 08:01:47 Sir_Ostara
NZEC in Java for Test Case 5..pls hlp :(
2013-02-22 09:58:54 napster
getting runtime error after running 5 test cases .......my submission id:8761900
2013-01-20 08:34:32 S__L
Check for the bounds ! ;)
2013-01-05 23:12:07 Avinash Thummala
Nice prob!
2012-06-21 12:09:37 Rishi Mukherje
please open for all languages. why not python.
2012-06-20 06:23:42 data
@sandeep use return 0
2012-05-29 21:29:24 sandeep pandey
Why NZEC in Java while C++ is passing
Could anyone tell me..?
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.