E

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>

using namespace std;
const int maxn = 2*1e9+5;
int dp[100][100];
int a[100];

//lead是否有前导0
int dfs(int pos,int sta, int lead, bool limit){
    if(pos == -1)
        return sta >= 32;
    if(!limit && !lead && dp[pos][sta] != -1)
        return dp[pos][sta];
    int up = limit?a[pos]:1;
    int ans = 0;
    for(int i = 0;i <= up;i++){
        if(lead && i == 0)
            ans += dfs(pos-1, sta, lead, limit && a[pos] == i);    //有前导0的就不统计在内
        else{
            ans += dfs(pos-1, sta + (i == 0?1:-1),lead && i == 0,limit && a[pos] == i);
        }
    }
    //无限制，切无前导0
    if(!limit && !lead)
        dp[pos][sta] = ans;
    return ans;
}

int solve(int x){
    int pos = 0;
    while(x){
        a[pos++] = x&1;
        x >>= 1;
    }
    //32当作0使用
    return dfs(pos-1, 32, true, true);
}

int main(){
    memset(dp, -1, sizeof(dp));
    int a, b;
    while(~scanf("%d%d", &a, &b)){
        int ans = solve(b) - solve(a-1);
        printf("%d
", ans);
    }
    return 0;
}