BETA

Difficulty Level: Basic

Submissions: 173 Accuracy:

44.51%

Numbers having two adjacent set bits
     

Given a number N. The task is to check whether there is pair of adjacent set bit or not in the binary representation of number.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains a number N.

Output:
If the number has pair of adjacent set bits print "Yes" else print "No".

Constraints:
1<=T<=500
1<=N<=1012

Example:
Input:

2
1

3
Output:
No
Yes

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

Contributor: Arun Tyagi

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

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