The number that remains#2808
Given a sequence of consecutive natural numbers from to (n < m), perform the following operations repeatedly until only one number remains:
1. Remove all numbers in odd positions from the sequence. 2. From the remaining sequence, remove all numbers in even positions.
Your task is to determine the last remaining number.
The input consists of two lines: the first line contains the integer , and the second line contains the integer , where n < m < 1000000000.
Output the last remaining number.
Example 1