Given a number N. Write a program to check whether every bit in the binary representation of the given number is set or not.
First line of input contains a single integer T which denotes the number of test cases. T test cases follows. First line of each test case contains a single integer N which denotes the number to be checked.
For each test case, print "YES" without quotes if all bits of N are set otherwise 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.