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 sys
from math import *
from fractions import gcd
readints=lambda:map(int, input().strip('\n').split())

l,r=readints()

maxn=2*(10**9)
twos=set()
i=2
while i<=maxn:
    twos.add(i)
    i*=2

threes=set()
i=3
while i<=maxn:
    threes.add(i)
    i*=3

nums=set()
nums.add(1)
for x in twos:
    for y in threes:
        if x*y>maxn: continue
        nums.add(x*y)
for x in twos:
    nums.add(x)
for y in threes:
    nums.add(y)

# nums=list(sorted(list(nums)))


ans=0
for x in nums:
    if l<=x and x<=r:
        ans+=1
print(ans)
