Most likely you already know what is a prime number. Just in case, we recall that a prime is a positive integer that has exactly two different positive integer divisors. In fact, this definition greatly limits your consciousness, so let's try to give an equivalent definition of prime numbers...
A prime number is such an integer $$$p \gt 1$$$ that there is no such pair of integers $$$x$$$ and $$$y$$$ that $$$x \times y = p$$$ and $$$1 \lt x \le y \lt p$$$. It seems that nothing has changed, but in fact it greatly expands your consciousness. Perhaps, reading this definition, you thought about prime numbers over the multiplication operation. Yes, this is true if we assume that «$$$\times$$$» is a multiplication operation. But what if "$$$\times$$$" is not a multiplication operation, but a bitwise "OR" operation? Can you now determine whether a number $$$n$$$ is prime or not? Let's check it out!
The single line contains a single integer $$$n$$$ — the number you need to check that it is a prime number over the bitwise "OR" operation.
$$$$$$1 \le n \le 10^{18}$$$$$$
In a single line, print "Yes" if the number is a prime over the bitwise "OR" operation, otherwise print "No".
2
Yes
42
No
Bitwise OR of two non-negative integers $$$a$$$ and $$$b$$$ is the number $$$c = a\ OR\ b$$$, such that each of its digits in binary notation is $$$1$$$ if and only if at least one of $$$a$$$ or $$$b$$$ have $$$1$$$ in the corresponding position in binary notation.
