영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
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, … Each number was twice as large as the previous one, which makes the numbers grow very quickly.
| “This... this is more than the power of friendship”, whispered Louise. |
| “It is the power of powers of two”. |
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 ≤ N ≤ 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. To earn points for a group, you must pass all test cases in that group.
| Group | Points | Constraints |
|---|---|---|
| 1 | 20 | N ≤ 100 |
| 2 | 80 | No additional constraints. |
예제
예제 1
1
Yes
예제 2
2
Yes
예제 3
3
No
예제 4
513
No