an easy problem
#include<iostream>
using namespace std;
int n;
//求二进制数中1的个数
int calc(int num) {
int ans = 0;
while (num) {
ans++;
num &= num - 1;
}
return ans;
}
int main()
{
while (cin >> n && n) {
int tmp = n;
int num = calc(n);
while (++tmp) {
if (calc(tmp) == num) {
cout << tmp << endl;
break;
}
}
}
return 0;
}