The Least Common Multiple of two integers and is the smallest integer , such that is divided by both and .
Given an integer , you will have to determine whether it is possible to find another integer other than itself, so that .
The only line of input will contain one integer ().
Output a single line, “Yes” if it is possible to find one such integer for , or “No” otherwise.
Input | Output |
---|---|
4 | Yes |