A little girl loves problems on bitwise operations very much. Here's one of them.

You are given two integers l and r. Let's consider the values of $\text{[math]}$ for all pairs of integers a and b (l ≤ a ≤ b ≤ r). Your task is to find the maximum value among all considered ones.

Expression $\text{[math]}$ means applying bitwise excluding or operation to integers x and y. The given operation exists in all modern programming languages, for example, in languages C++ and Java it is represented as "^", in Pascal — as "xor".

Input

The single line contains space-separated integers l and r (1 ≤ l ≤ r ≤ 10¹⁸).

Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.

Output

In a single line print a single integer — the maximum value of $\text{[math]}$ for all pairs of integers a, b (l ≤ a ≤ b ≤ r).

Little Girl and Maximum XOR

Examples