Distinct Primes#8549

Distinct Primes

1 second
128 megabytes
Very easy

Lucky Numbers are those positive integers that have at least three distinct prime factors. For example and are the first two. You are given a positive integer , and you are asked to find the -th lucky number.

Input

The first line contains the number of test cases . Each of the next lines contains one integer n~(n \le 2 \cdot 10^6).

Output

Print lines, each containing the corresponding lucky number for that test case.

Examples

Example 1

Loading
Loading