## 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 7Output: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: | ASM32-GCC MAWK BC C-CLANG C C++ 4.3.2 CPP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JAVA JS-MONKEY KTLN NIM NODEJS OBJC OBJC-CLANG OCT PICO PROLOG PYPY PY_NBC R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET |

Resource: | Own Problem |