## H:An Easy Problem

- 总时间限制:
- 1000ms
- 内存限制:
- 65536kB

- 描述
- As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form.

Given a positive integer I, you task is to find out an integer J, which is the minimum integer greater than I, and the number of '1's in whose binary form is the same as that in the binary form of I.

For example, if "78" is given, we can write out its binary form, "1001110". This binary form has 4 '1's. The minimum integer, which is greater than "1001110" and also contains 4 '1's, is "1010011", i.e. "83", so you should output "83".
- 输入
- One integer per line, which is I (1 <= I <= 1000000).

A line containing a number "0" terminates input, and this line need not be processed.
- 输出
- One integer per line, which is J.
- 样例输入
1
2
3
4
78
0

- 样例输出
2
4
5
8
83

- 来源
- POJ Monthly,zby03

- 全局题号
- 1455
- 提交次数
- 105
- 尝试人数
- 72
- 通过人数
- 68