HUNAN UNIVERSITY ACM/ICPC Judge Online_Problem 10038_Lowest Bit

Lowest Bit

Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB

Total submit users: 713, Accepted users: 664

Problem 10038 : No special judgement

Problem description

Given an positive integer A (1 <= A <= 109), 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 <= 109). 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

CODE

/*

  Name: 10038_Lowest Bit

  Copyright:  yangchun's

  Author:  yangchun

  Date: 14-06-08 20:01

  Description: HUNAN UNIVERSITY ACM/ICPC Judge Online_Problem 10038_Lowest Bit

*/



#include <algorithm>

#include <iostream>



using namespace std;



int main()

{

    //freopen("in.txt","r",stdin);

    //freopen("out.txt","w",stdout);

    

    long A,result[31]={1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,262144,524288,1048576,2097152,4194304,8388608,16777216,33554432,67108864,134217728,268435456,536870912,1073741824};

    

    while(scanf("%d",&A),A!=0)

    {

         int i=0;

         while(A%2 == 0)

         {

               A /= 2;

               i++;     

         }

         printf("%d/n",result[i]);

    }

    

    return 0;

}