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.
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.
If the number has pair of adjacent set bits print "Yes" else print "No".
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.