Power of 2
Submissions: 45740   Accuracy:

30.97%

  Difficulty: Basic   Marks: 1

Given a positive integer N, check if N is a power of 2. That is N is 2x for some x.

Input:
The first line contains T denoting the number of test cases. Each test case contains a single positive integer N.

Output:
Print "YES" if it is a power of 2 else "NO". (Without the double quotes)

Constraints:
1 <= T <= 100
0 <= N <= 1018

Example:
Input :
2
1
98

Output :
YES
NO

Explanation:
Testcase 1:
  (20 == 1)

** For More Input/Output Examples Use 'Expected Output' option **

Author: dipjal1996


Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.