dp = [0] * 55
for n in range(1,55) :
    dp[n] = 2*dp[n-1] + (1 << (n-1))

def countOne(N) :
    ans = 0
    for n in range(54,0,-1) :
        MSB = N & (1 << (n-1))
        
        if MSB :
            N -= MSB
            ans += dp[n-1] + (N + 1)
    
    return ans

A, B = map(int, input().split())
print(countOne(B) - countOne(A-1))