HDU1196

Lowest Bit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12623    Accepted Submission(s): 9203

Problem Description

Given an positive integer A (1 <= A <= 100), output the lowest bit of A.

For example, given A = 26, we can write A in binary form as 11010, so the lowest bit of A is 10, so the output should be 2.

Another example goes like this: given A = 88, we can write A in binary form as 1011000, so the lowest bit of A is 1000, so the output should be 8.

 

Input

Each line of input contains only an integer A (1 <= A <= 100). A line containing "0" indicates the end of input, and this line is not a part of the input data.

 

Output

For each A in the input, output a line containing only its lowest bit.

 

Sample Input

26880

 

Sample Output

28
//HDU1196 基础题//Lowest Bit http://acm.hdu.edu.cn/showproblem.php?pid=1196//2017.09.15 by wyj#include#includeusing namespace std;int main(){int a;while (cin >> a && a) {int b = 1;while (a % 2 == 0) {a /= 2;b *= 2;}cout << b << endl;}return 0;}