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.
l, r = map(int, input().split());
def f(a):
    ans = 1;
    for q in range(2, a + 1):
        ans *= q;
    return ans;
def much(l):
    a = 1;
    cnt = -1;
    while a <= l:
        a = a * 3;
        cnt = cnt + 1;
    k3 = cnt;
    a1 = 1;
    cnt = -1;
    while a1 <= l:
        a1 = a1 * 2;
        cnt = cnt + 1;
    k2 = cnt; # (k3 + 2) 
    ans = (k3 + 1) * (k3 + 2) // 2;
    #print(k2);
    for q in range(k3 + 1, k2 + 1):
        x = 2 ** q;
        while 1:
            ans += 1;
            x = x * 3 // 2;
            if x > l:
                break;
    return ans;
k = much(r) - much(l - 1);
print(k);