Problem A
The Powers of Two
Languages
en
sv
Louise and her close friend Elin have always been completely unstoppable together. They called their unbeatable duo-energy the Power of Friendship, and when they worked together, nothing could stop them.
But one day, Louise discovered something even greater. Something so big that it might not fit in a 32-bit integer.
She was counting by the campfire and noticed that certain numbers grew in a special way: $1, 2, 4, 8, 16, 32, \dots $ Each number was twice as large as the previous one, which makes the numbers grow very quickly.
\begin{align*} & \text{``This... this is more than the power of friendship'', whispered Louise.} \\ & \text{``It is the power of powers of two''.} \end{align*}Yes. The power of powers of two is truly something special. But now Louise and Elin wonder whether a given number $N$ will ever appear in the sequence of powers of two.
Input
The input consists of a single integer $N$ ($1 \leq N \leq 10^{18}$).
Output
Print Yes if $N$ is a power of two, otherwise print No.
Scoring
Your solution will be tested on a set of test groups, each worth a number of points. Each test group contains a set of test cases. To get the points for a test group you need to solve all test cases in the test group.
|
Group |
Points |
Constraints |
|
$1$ |
$20$ |
$N \le 100$ |
|
$2$ |
$80$ |
No additional constraints. |
| Sample Input 1 | Sample Output 1 |
|---|---|
1 |
Yes |
| Sample Input 2 | Sample Output 2 |
|---|---|
2 |
Yes |
| Sample Input 3 | Sample Output 3 |
|---|---|
3 |
No |
| Sample Input 4 | Sample Output 4 |
|---|---|
513 |
No |
