#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int N = 40;

int len;
int nums[N], f[N][N][N];

int dfs(int pos, int a, int b, int lead, int limit) {
    if (!pos) return a >= b;
    if (!limit && !lead && ~f[pos][a][b]) return f[pos][a][b];
    int up = limit ? nums[pos] : 1, res = 0;
    for (int i = 0; i <= up; i ++ ) {
        if (i) res += dfs(pos - 1, a, b + 1, lead && !i, limit && i == up);
        else res += dfs(pos - 1, a + (!lead && !i), b, lead && !i, limit && i == up);
    }
    return limit ? res : (lead ? res : f[pos][a][b] = res);
}

int calc(int x) {
    len = 0;
    memset(f, -1, sizeof f);
    while (x) nums[ ++ len] = x % 2, x /= 2;
    return dfs(len, 0, 0, 1, 1);
}

int main() {
    int l, r; cin >> l >> r;
    cout << calc(r) - calc(l - 1);
    return 0;
}