Given a number N, Write a program to find a number which is greater than or equal to N and is a smallest power of 2.
First line of input contains a single integer T which denotes the number of test cases. Then T test cases follows. First line of each test case contains a single integer N.
For each test case, print a number which is greater than or equal to N and is a nearest power of 2.
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.