
Lowest Bit 
Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB 
Total submit users: 110, Accepted users: 107 
Problem 10021 :
No special judgement

Problem description 
Given an positive integer A (1 <= A <= 10^9), 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 <= 10^{9}). 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 
26
8
0 
Sample Output 
2
8 
Problem Source 
HNU 1'st Contest

Submit
Discuss
Judge Status
Problems
Ranklist

