insidcode
ProblemsDuelLeaderboardStats
Sign In
  1. Home
  2. Problems
  3. Check if a number is a power of 2 using bitwise operators (`n & (n - 1)`).

Check if a number is a power of 2 using bitwise operators (`n & (n - 1)`).

Difficulty: Easy

Phase: 6 · Mixed Logical Challenges

XP Reward: 10 XP

Topics: Mixed Logical Challenges, Easy

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Check if integer N is a power of 2 using bitwise operators. Print 'Yes' or 'No'. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

  • -10^9 <= N <= 10^9

Examples

Example 1

Input: 16

Output: Yes

Explanation: Sample execution for input 16