Check if a number is a power of 2
Given a positive integer n, you are asked to find out if it’s a power of 2.
Input
The first line of the input contains a single integer n (2 ≤ n ≤ ).
Output
The program should print Yes if n is a power of 2 and No otherwise.
Examples
Input | Output |
|---|---|
8 | Yes |
17 | No |
2048 | Yes |
Hint
What property is specific to the powers of 2 (1, 2, 4, 8, 16, 32, 64, …) when they’re represented in binary form?
Constraints
Time limit: 2 seconds
Memory limit: 512 MB
Output limit: 1 MB