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
import sys
import bisect  # https://pythonworld.ru/moduli/modul-bisect.html
from heapq import heapify, heappop, heappush
from itertools import *  # https://pythonworld.ru/moduli/modul-itertools.html
from collections import deque, OrderedDict
from pprint import pprint
sys.setrecursionlimit(10 ** 6)
# f = open('input.txt')
# f.close()
II = lambda: sys.stdin.readline()  # f.readline()
inp = lambda: int(II())
inpm = lambda: map(int, II().split())
inpl = lambda: list(inpm())
DEBUG = False
def set_debug(deb:bool=True):
    global DEBUG
    DEBUG = deb
def debug(**kwargs):
    if DEBUG:
        arr = []
        for k, w in kwargs.items():
            arr.append(f'{k}: {w}')
        print(*arr, sep=', ')

WHITE, GREY, BLACK, RED = 0, 1, 2, 3
EPS = 1e-9
INF = int(1e18)
MOD = int(1e9) + 7  # 998244353
N = 2000009

# set_debug()
def solve():
    l, r = inpm()
    x2 = [1]
    while x2[-1] * 2 <= r:
        x2.append(x2[-1] * 2)
    x3 = [1]
    while x3[-1] * 3 <= r:
        x3.append(x3[-1] * 3)

    res = 0
    for x in x2:
        for y in x3:
           if l <= x * y <= r:
               res += 1
    print(res)


# set_debug()
'''

'''

def main():
    t = 1 #  inp()  # 1  #
    for i in range(t):
        solve()
        # print()
main()