Given a non-negative number n. The problem is to set the rightmost unset bit in the binary representation of n. If there are no unset bits, then just leave the number as it is.
The first line of the input contains an integer T denoting number of test cases. Each of the following T lines will contain an integer N
For each of the test case print the required answer.
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.