**Problem Description**

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.

**Input**

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

**Output**

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

**Sample Input**

2 3 9

**Sample Output**

No No Yes

**Hint**

Please use __int64 for input.

**Source**

2013绍兴市赛