BETA

Difficulty Level: Medium

Submissions: 1183 Accuracy:

12.76%

Power of Largest Prime
       

You are given a number 'n'. Your task is to check whether the power of its largest prime factor is greater than one or not.

Print "YES" if the power is greater than one otherwise print "NO";

Input :

First line contain 'T', number of test cases. T lines follow. 
Each line contains the number n.


Output :

Print the required answer for each test case in a separate line.

Constraints :
1 <= T <= 30

1 <= n <= 10^18

Example :

Input :

3
36
100
13

Output :

YES
YES
NO

Explanation

36 = 2*2*3*3 
largest prime factor is 3. Its power is greater than 1.

** For More Input/Output Examples Use 'Expected Output' option **

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.