//看看会不会爆int!数组会不会少了一维！

//取物问题一定要小心先手胜利的条件

#include <bits/stdc++.h>

using namespace std;

#pragma comment(linker,"/STACK:102400000,102400000")

#define LL long long

#define ALL(a) a.begin(), a.end()

#define pb push_back

#define mk make_pair

#define fi first

#define se second

#define haha printf("haha\n")

LL x, y;

vector<LL> ve;

void solve(LL tmp, LL tmp1, LL i, LL j, int len){

    int cnt = ;

    while (true){

        if (cnt %  == ){

            cnt++;

            if (len + i > ) break;

            len += i;

            tmp = tmp << i; tmp += tmp1;

            ve.pb(tmp);

        }

        else {

            cnt++;

            if (len + j > ) break;

            len += j;

            tmp = tmp << j;

            ve.pb(tmp);

        }

        //printf("tmp = %lld\n", tmp);

    }

}

void init(){

    for (int i = ; i <= ; i++){///这个是1的东西

        LL tmp1 = ;

        for (int f = ; f < i; f++){

            tmp1 |= (1LL << f);

        }

        ve.pb(tmp1);

        for (int j = ; j <= ; j++){///这个是0的东西

            if (i + j > ) break;

            LL tmp = tmp1 << j;

            ve.pb(tmp);

            solve(tmp, tmp1, i, j, i + j);

        }

    }

    sort(ALL(ve));

}

int main(){

    init();

    while (scanf("%lld%lld", &x, &y) == ){

        int lb = lower_bound(ve.begin(), ve.end(), x) - ve.begin();

        int rb = upper_bound(ve.begin(), ve.end(), y) - ve.begin();

        printf("%d\n", rb - lb);

    }

    return ;

}