Little Girl and Maximum XOR CodeForces

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 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 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 С++. 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 for all pairs of integers a, b (l ≤ a ≤ b ≤ r).

Example

Input

1 2

Output

3

Input

8 16

Output

31

Input

1 1

Output

0

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

ll L,R;

int main()
{   cin>>L>>R;
    int i;
    for(i=63;i>=0;i--) if((L&(1ll<<i))^(R&(1ll<<i))) break;
    ll ans=pow(2,i+1)-1;
    cout<<ans<<endl;
}