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


class CodeforcesTask926ASolution:
    def __init__(self):
        self.result = ''
        self.l_r = []

    def read_input(self):
        self.l_r = [int(x) for x in input().split(" ")]

    def process_task(self):
        x = 0
        y = 0
        cnt23 = 0
        for a in range(int(max(0.0, math.log(self.l_r[1], 2) + 2))):
            for b in range(int(max(0.0, math.log(self.l_r[1], 3) + 2))):
                if self.l_r[0] <= (2 ** a) * (3 ** b) <= self.l_r[1]:
                    cnt23 += 1
        self.result = str(cnt23)

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask926ASolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
