Lowest Bit

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

26

88

0

Sample Output

2

8

 1 #include <stdio.h>
 2 #include <math.h>
 3
 4
 5 int main(){
 6     int A;
 7     int timer;
 8
 9     while(1){
10         timer=0;
11         scanf("%d",&A);
12
13         if(A==0)
14             break;
15
16         while(1){
17             if(A%2==0){
18                 timer++;
19                 A/=2;
20             }
21
22             else{
23                 printf("%.0lf\n",pow(2.0,timer));
24                 break;
25             }
26
27         }
28     }
29
30     return 0;
31 }