本站作为LDUOnlineJudge的测试版本进行演示,官方网站请访问http://icpc.ldu.edu.cn
[Hidden]

1275. A. Binarize It


Description

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. The Problem:


Given an integer, your program should binarize it.

Input

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).

Output

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.

Samples

Input Copy
3
900
16
4000
Output
Input value: 900
1024

Input value: 16
16

Input value: 4000
4096

Source

UCF2016 PRACTICE
Problem Information

Time Limit: 1000MS (C/C++,Others×2)
Memory Limit: 128MB (C/C++,Others×2)
Special Judge: No
AC/Submit: 1 / 1
Tags:
Contests involved

1031. UCF 2016 Practice
My history solutions

You didn't submit any solution!
Submit your solution

Login Register