P8054 A Prime Factors

Define $f(x)$ as the number of prime factors of $x$ after prime factorization, counting multiplicities. For example, $f(6)=2$ and $f(12)=3$. Specifically, let $x=p_1^{a_1}p_2^{a_2}\cdots p_k^{a_k}$, where $p_1,p_2,\ldots,p_k$ are pairwise distinct primes. Then $f(x)=a_1+a_2+\cdots + a_k$. Given a number $n$, determine whether there exists an integer $m$ with $1

The first line contains an integer $T$, which represents the number of test cases. The next $T$ lines each contain a positive integer $n$.

Output $T$ lines. For the $i$-th test case, if the given $n$ has some $m$ satisfying $1

**Sample Explanation #1** $f(2)=1$, and there is no $1