using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
using System.Numerics;
using System.Diagnostics;

partial class Solver {
    public void Run() {
        var a = nl();
        var b = nl();

        cout.WriteLine(Solve(a, b));
    }

    private long Solve(long a, long b) {
        if (a > 0) {
            return Solve(0, a - 1) ^ Solve(0, b);
        }
        var x = b + 1;
        long ans = 0;
        for (int i = 0; i < 60; i++) {
            long cycle = 2L << i;
            var m = x % cycle;
            var bitNum = m > (cycle / 2) ? (m - cycle / 2) : 0;
            if (i == 0) {
                bitNum += x / cycle;
            }
            if (bitNum % 2 == 1) {
                ans |= 1L << i;
            }
        }
        return ans;
    }
}

public class PriorityQueue<T> {
    private T[] array = new T[100];
    private int size = 0;
    private readonly Comparer<T> _comparer;

    public PriorityQueue() {
        _comparer = Comparer<T>.Default;
    }

    public PriorityQueue(Comparison<T> comp) {
        _comparer = Comparer<T>.Create(comp);
    }

    public int Count { get { return size; } }

    private void Swap(int a, int b) {
        var t = array[a];
        array[a] = array[b];
        array[b] = t;
    }

    private void Expand() {
        var newlist = new T[array.Length * 2];
        Array.Copy(array, newlist, array.Length);
        array = newlist;
    }

    public bool Any() {
        return size > 0;
    }

    public void Enqueue(T newValue) {
        if (size >= array.Length) {
            Expand();
        }
        array[size++] = newValue;
        int pos = size - 1;
        while (pos > 0) {
            int parent = (pos - 1) / 2;
            if (_comparer.Compare(array[parent], array[pos]) > 0) {
                Swap(parent, pos);
                pos = parent;
            } else {
                break;
            }
        }
    }

    public T Peek() {
        return array[0];
    }

    public T Dequeue() {
        var top = array[0];
        array[0] = array[--size];
        int pos = 0;
        while (pos * 2 + 1 < size) {
            int left = pos * 2 + 1;
            int right = left + 1;
            int next = left;
            if (right < size && _comparer.Compare(array[left], array[right]) > 0) {
                next = right;
            }

            if (_comparer.Compare(array[pos], array[next]) > 0) {
                Swap(next, pos);
                pos = next;
            } else {
                break;
            }
        }

        return top;
    }
};



// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner {
    public static void Main(string[] args) {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
}

public class Scanner {
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size) {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size) {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens() {
        while (true) {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}


Measured memory_bytes: 13268