Non-Prime Factors（素数筛 + 质因分解）

In many programming competitions, we are asked to find (or count the number of) Prime Factors of an integer ii. This is boring. This time, let’s count the number of Non-Prime Factors of an integer ii, denoted as NPF(i).

For example, integer 100100 has the following nine factors: {1,2⎯⎯,4,5⎯⎯,10,20,25,50,100}{1,2_,4,5_,10,20,25,50,100}. The two which are underlined are prime factors of 100100 and the rest are non-prime factors. Therefore, NPF(100)= 77.

Input

The first line contains an integer QQ (1≤Q≤3⋅1061≤Q≤3⋅106) denoting the number of queries. Each of the next QQ lines contains one integer ii (2≤i≤2⋅1062≤i≤2⋅106).

Output

For each query ii, print the value of NPF(i).

Warning

The I/O files are large. Please use fast I/O methods.

Sample Input 1	Sample Output 1
4 100 13 12 2018