#include<cstdio>

#include<cstring>

#include<iostream>

// #include<map>

using namespace std;

#define LL long long

const LL MAXN = ;

LL A, B;

LL num[MAXN], tot, f[MAXN][MAXN][MAXN];

LL dfs(LL x, bool lim, LL ze, LL on) {

    if(x == ) return

        (ze != -) && (on != -) && (ze >= on);

    if(!lim && f[x][ze][on]) return f[x][ze][on];

    LL ans = ;

    for(LL i = ; i <= (lim ? num[x] : ); i++) {

        if(i == ) ans += dfs(x - , lim && (i == num[x]), ze == - ?  : ze + , on);

        else {

            if(on == -) ans += dfs(x - , lim && (i == num[x]), , );

            else ans += dfs(x - , lim && (i == num[x]), ze, on + );

        }

    }

    if(!lim) f[x][ze][on] = ans;

    return ans;

}

LL solve(LL x) {

    tot = ;

    while(x) num[++tot] = x % , x >>= ;

    return dfs(tot, , -, -);

}

int main() {

    cin >> A >> B;

    cout << solve(B) - solve(A - );

    return ;

}

/*

1234 4444

2

*/