A positive integer is called a 2-3-integer, if it is equal to 2x·3y for some non-negative integers x and y. In other words, these integers are such integers that only have 2 and 3 among their prime divisors. For example, integers 1, 6, 9, 16 and 108 — are 2-3 integers, while 5, 10, 21 and 120 are not.

Print the number of 2-3-integers on the given segment [l, r], i. e. the number of sich 2-3-integers t that l ≤ t ≤ r.

Input

The only line contains two integers l and r (1 ≤ l ≤ r ≤ 2·109).

Output

Print a single integer the number of 2-3-integers on the segment [l, r].

Examples

Input

1 10


Output

7


Input

100 200


Output

5


Input

1 2000000000


Output

326

Note

In the first example the 2-3-integers are 1, 2, 3, 4, 6, 8 and 9.

In the second example the 2-3-integers are 108, 128, 144, 162 and 192.
l,r=map(int,input().split())
s2=[]
s3=[]
i=1
j=1
s23=[]
while 2**i<=r:
    test=2**i
    s2.append(test)
    i+=1
while 3**j<=r:
    test=3**j
    s3.append(test)
    j+=1
i=1
j=1
if len(s3)>0:
    while True:
        for k in range(len(s3)):
            if s3[k]*2**i<=r:
                s23.append(s3[k]*2**i)
            else:
                break
        i+=1
        if s3[0]*2**i>r:
            break
if len(s2)>0:
    while True:
        for k in range(len(s3)):
            if s2[k]*3**j<=r:
                s23.append(s2[k]*3**j)
            else:
                break
        j+=1
        if s2[0]*3**j>r:
            break
end=set()
for i in [1]+s2+s3+s23:
    if i>=l and i<=r:
        end.add(i)
print(len(end))
    
