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 = [int(lr) for lr in raw_input().split(" ")]
ans = 0
x2 = list()
i = 0
while i < 31:
	i2 = 2**i
	if i2 > r:
		break
	x2.append(i2)
	i += 1
x3 = list()
i = 0
while i < 20:
	i3 = 3**i

	if i3 > r:
		break
	x3.append(i3)
	i += 1

lenx2 = len(x2)
lenx3 = len(x3)
x23 = list()
i = 0
while i < lenx2:
	a = x2[i]
	j = 0
	while j < lenx3:
		b = x3[j]
		ab = a*b
		if ab > r:
			break
		if ab >= l:
			x23.append(ab)
		j += 1
	i += 1

print len(x23)