#include<bits/stdc++.h>

using namespace std;
#define sz(x) (int)x.size()
#define lll __int128
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


void func() {
    long long x, y;
    cin >> x >> y;
    set<long long> st;
    for (int n = 1; n <= 63; n++) {
        for (int m = 1; m <= 63; m++) {
            lll ans = 0;
            bool curr = 0;
            int sum = 0;
            while (sum <= 63) {

                if (curr) {
                    lll new_ans = (ans << m);
                    if (new_ans > (lll) y and sum + m <= 63) {
                        break;
                    } else {
                        ans = new_ans;
                        sum += m;
                    }
                } else {
                    lll new_ans = (ans << n) + (1ll << n) - 1;
                    if (new_ans > (lll) y and sum + n <= 63)break;
                    else ans = new_ans, sum += n;
                }
                if (ans >= x and ans <= y) {
                    st.insert(ans);
                }
                curr ^= 1;
            }
        }
    }
    cout << sz(st) << '\n';
}

int main() {

    int t = 1;
    //cin >> t;
    for (int i = 0; i < t; i++) {
        func();
    }
}
// 5 3 1 2 4