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.
n, m = raw_input().split()
n = int(n)
m = int(m)

arr = [1]
i = 0
pos = 0
while i < len(arr):
    val1 = arr[i]*2
    val2 = arr[i]*3
    j = i
    non = True
    mom = True
    while j < len(arr):
        if (arr[j] == val1):
            non = False
        if (arr[j] == val2):
            mom = False
        j += 1
    if (val1 <= m and non):
        arr.append(val1)
    if (val2 <= m and mom):
        arr.append(val2)
    i += 1
arr.sort()
num = 0
for i in range(len(arr)):
    if arr[i] >= n and arr[i] <= m:
        num += 1
print(num)
