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.
import random
def pw(a, b):
    s = 1
    for i in range(b):
        s *= a
    return s

def quicksort(nums):
   if len(nums) <= 1:
       return nums
   else:
       q = random.choice(nums)
   l_nums = [n for n in nums if n < q]
 
   e_nums = [q] * nums.count(q)
   b_nums = [n for n in nums if n > q]
   return quicksort(l_nums) + e_nums + quicksort(b_nums)

ll = 0
rr = 0
ll, rr = map(int, input().split())
v = []
for i in range(31):
    for j in range(21):
        s = pw(2, i) * pw(3, j)
        v.append(s)
v = quicksort(v)
x = 0
y = 0
l = -1
r = len(v)
while l + 1 < r:
    mid = (l + r) // 2
    if v[mid] >= ll:
        r = mid
    else:
        l = mid
x = r
l = 0
r = len(v)
while l + 1 < r:
    mid = (l + r) // 2
    if v[mid] > rr:
        r = mid
    else:
        l = mid
y = r
print(y - x)