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.
# ���� ������� ����� ������[https://rep.bntu.by/bitstream/handle/data/47746/Metod_predvaritelnyh_vychislenij_dlya_resheniya_zadach_po_informatike.pdf?sequence=1 <- google:�"���������� 2-3-����� �� �������"�]

limit = 2000*1000*1000

powers_of_2 = []
i = 0
while True:
    p = 2 ** i
    if p > limit:
        break
    powers_of_2.append(p)
    i += 1

powers_of_3 = []
i = 0
while True:
    p = 3 ** i
    if p > limit:
        break
    powers_of_3.append(p)
    i += 1

(l, r) = map(int, input().split())

n = 0
for i in powers_of_2:
    for j in powers_of_3:
        if l <= i * j <= r:
            n += 1
print(n)