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 bsl(l, rb, k):
    while l < rb:
        mid = (l + rb) // 2
        if nums[mid] >= k:
            rb = mid
        else:
            l = mid+1
    return l


def bsr(l, r, k):
    while l < r:
        mid = (l + r + 1) // 2
        if nums[mid] <= k:
            l = mid
        else:
            r = mid - 1
    return l


if __name__ == '__main__':
    stop = int(2e9)

    nums = []
    i = 1
    while i <= stop:
        nums.append(i)
        i *= 2

    ts = len(nums)

    for i in range(ts):
        cur = nums[i] * 3
        while cur <= stop:
            nums.append(cur)
            cur *= 3
    nums.sort()

    ln = len(nums)
    l, r = map(int, input().split())

    le, re = 0, ln-1

    while le < ln and nums[le] < l:
        le += 1

    while re >= 0 and nums[re] > r:
        re -= 1

    #print(le, re, nums[le], nums[re], nums[le:re+1])

   # if l == r and nums[le] == l:
   #     print(1)
    #else:
     #   print(re - le + 1 )
    print(re-le+1)
