Biving loves number theory. In the spare time, she like reading some books about number theory. One day, she saw a special kind of number namely noodle number. That’s strange, so she look into the definition of it.

If there exist two integers X and Y, satisfy that X>=Y>1 and X%Y=0(i.e. X is divisible by Y), then the integer N = X*Y will be called noodle number. Here comes your easy task, help Biving to verify whether an integer is a noodle or not.

The input contains multiple test cases (<= 100). Each test case has only one integer N(1<=N<=1,000,000,000,000).

For each test case, output “Yes”(without the quotation) if N is a noodle number, otherwise output “No”.

Please use long long for input.