Module Expr Str Assign NameStore Str ClassDef bases NameLoad body FunctionDef arguments args NameParam NameParam defaults body Expr Str Assign NameStore Num Assign TupleStore NameStore NameStore NameLoad For NameStore Call NameLoad NameLoad BinOpAdd NameLoad Num body For NameStore Call NameLoad BinOpAdd NameLoad Num BinOpAdd NameLoad Num body Assign NameStore Call NameLoad NameLoad BinOpBitXor NameLoad NameLoad Return NameLoad decorator_list decorator_list If CompareEq NameLoad Str body Import alias Assign NameStore AttributeLoad NameLoad attr Assign NameStore Call NameLoad Call AttributeLoad Call AttributeLoad NameLoad attr attr Assign NameStore Call NameLoad Call AttributeLoad Call AttributeLoad NameLoad attr attr Assign NameStore TupleLoad NameLoad NameLoad Assign NameStore BinOpMod Str Call AttributeLoad Call NameLoad attr NameLoad Print NameLoad
N/A N/A 
iven two integers: L and R,

find the maximal values of A xor B given, L <= A <= B <= R

Input Format
The input contains two lines, L is present in the first line.
R in the second line.

Constraints
1 <= L <= R <= 103

Output Format
The maximal value as mentioned in the problem statement.
 N/A __author__ Danyang Solution N/A object N/A solve N/A N/A self cipher N/A N/A N/A 
        main solution function
        :param cipher: the cipher
         N/A global_max -1 N/A N/A A B cipher N/A i N/A xrange A N/A B 1 N/A N/A j N/A xrange N/A i 1 N/A B 1 N/A N/A global_max N/A max global_max N/A i j N/A global_max N/A N/A N/A N/A __name__ __main__ N/A N/A sys N/A f N/A sys stdin N/A A N/A int N/A N/A N/A N/A f readline strip N/A B N/A int N/A N/A N/A N/A f readline strip N/A cipher N/A A B N/A s N/A %s
 N/A N/A N/A Solution solve cipher N/A s