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 math

l, r = [int(x) for x in input().split()]

ans = 0
d = []
d.append(1)
for i in range(1, int(2*math.log2(r))) :
    d.append(d[i - 1]*2)
x = 1
while (True) :
    if (x > r) : break
    ll = 0
    rr = int(math.log2(r) + 1)
    while (rr - ll > 1) :
        m = (ll + rr) // 2
        if (x*d[m] <= r) :
            ll = m
        else :
            rr = m
    ans += ll
    ll = -1
    rr = int(math.log2(r) + 1)
    while (rr - ll > 1) :
        m = (ll + rr) // 2
        if (x*d[m] >= l) :
            rr = m
        else :
            ll = m
    ans -= ll
    x *= 3

print(ans)

