Professor Boolando can only think in binary, or more specifically, in powers of 2. He converts any number you give him to the smallest power of 2 that is equal to or greater than your number. For example, if you give him 5, he converts it to 8; if you give him 100, he converts it to 128; if you give him 512, he converts it to 512.
Given an integer, your program should binarize it.
The first input line contains a positive integer, n, indicating the number of values to binarize.
The values are on the following n input lines, one per line. Each input will contain an integer between 2 and 100,000 (inclusive).
At the beginning of each test case, output “Input value: v” where v is the input value.
Then, on the next output line, print the binarized version. Leave a blank line after the output for each test case.
Input value: 900
Input value: 16
Input value: 4000