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.
def two_three(l, r):
    i, j = 1, 1
    s = list()
    s.append(i)
    t = list()
    t.append(j)
    while i <= 2 * (10 ** 9):
        i = 2 * i
        s.append(i)
    while j <= 2 * (10 ** 9):
        j = 3 * j
        t.append(j)
    m = list()
    for y in range(len(s)):
        for z in range(len(t)):
            m.append(s[y] * t[z])
    count = 0
    for x in range(0, len(m) - 1):
        if l <= m[x] <= r:
            count += 1
    return count


n, m = [int(i) for i in input().split()]
print(two_three(n, m))
