Yuhao and William are both great friends. One day, Yuhao told William about prime numbers but William got annoyed after knowing that prime numbers do not have any divisor except 1 and itself. William only likes non-prime numbers. To appease William, Yuhao decided to give William a problem:
Given a number N, find the number of its non-prime divisors.



Input

The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
The first and only line of each test case contains a single integer, N.

Output

For each test case, print a single line containing one integer denoting the answer to the problem.




Post a Comment

Previous Post Next Post