A number is said to be special if the number of divisors it has is equal to a power of 2. For example, 6 is a special number since it has four divisors 1,2,3 and 6. A very special number is a special number whose sum of divisors is also equal to a power of 2. Given a number, print the smallest very special number that is greater than or equal to the given number.
First line of the input contains a number t, the number of test cases to follow. The next t lines each contain a number N.
Print on a new line for each test case,the smallest very special number greater than or equal to N.
Time limit: 1 second
Memory limit: 64 MB