#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <stack>
#include <random>
#include <fstream>
#include <sstream>
#include <chrono>

#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) for (auto& x: v) cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)

#define int ll

using namespace std;

#ifdef __LOCAL
	#define dbg(x) cerr << #x << " : " << x << '\n'
	const int maxn = 20;
#else
	#define dbg(x)
	const int maxn = 2e5 + 20;
#endif

//tg: @galebickosikasa

ostream& operator << (ostream& out, vector<int>& v) {
	for (auto& x: v) out << x << ' ';
	return out;
}

ostream& operator << (ostream& out, pii& v) {
	out << v.fi << ", " << v.se;
	return out;
}

istream& operator >> (istream& in, pii& a) {
	in >> a.fi >> a.se;
	return in;
}

const ll inf = (ll) 2e9;
const ld pi = asin (1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

int ans = 0, s, t, deep = 31, flag = 0;
int f[35], g[35];

int left (int v, int d) {
	return v - g[d + 2] - 1;
}

int right (int v, int d) {
	return v + g[d + 2] + 1;
}

void dfs (int v = (1<<30), int d = 1, int state = 0) {
	if (state == 0) {
		if (s <= v && v <= t) {
			if (v != s) {
				ans += max (0ll, deep - d - 1);
				dfs (left (v, d), d + 1, 1);
			}
			if (v != t) {
				ans += max (0ll, deep - d - 1);
				dfs (right (v, d), d + 1, 2);
			}
		} else {
			if (v < s) dfs (right (v, d), d + 1, 0);
			else dfs (left (v, d), d + 1, 0);
		}
	} else if (state == 1) {
		if (v == s) {
			ans += f[d + 1] + max (0ll, deep - d - 1);
			dbg (ans);
			return;
		}
		if (v > s) {
			ans += f[d + 1] + (max (0ll, deep - d - 1)) * 2;
			dfs (left (v, d), d + 1, 1);
		} else {
			dfs (right (v, d), d + 1, 1);
		}
	} else {
		if (v == t) {
			ans += f[d + 1] + max (0ll, deep - d - 1);
			return;
		}
		if (v > t) {
			dfs (left (v, d), d + 1, 2);
		} else {
			ans += f[d + 1] + (max (0ll, deep - d - 1)) * 2;
			dfs (right (v, d), d + 1, 2);
		}
	}
}

signed main () {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	f[31] = f[30] = 0;
	int c = 1;
	for (int i = 29; i >= 0; --i) {
		f[i] = (f[i + 1] + c) * 2;
		++c;
	}
	fr (i, 32) g[i] = (1ll<<(32 - i)) - 1;
	cin >> s >> t;
	if (s > t) swap (s, t);
	dfs ();
	cout << ans << '\n';






}