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 java.util.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Ideone
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc = new Scanner(System.in);
		int l = sc.nextInt();
		int r = sc.nextInt();
		long a2[] = new long[1100];
		long a3[] = new long[1100];
		int size2 = 0, size3 = 0;
		a2[0] = 1;
		a3[0] = 1;
		for (int i = 1; i < 100; i++)
		{
			a2[i] = a2[i - 1] * 2;
			if (a2[i] > r)
			{
				size2 = i;
				break;
			}
		}
		for (int i = 1; i < 100; i++)
		{
			a3[i] = a3[i - 1] * 3;
			if (a3[i] > r)
			{
				size3 = i;
				break;
			}
		}
		long ans = 0;
		for (int i = 0; i <= size2; i++)
	{
		for (int j = 0; j <= size3; j++)
		{
			if (a2[i] * a3[j] <= r && a2[i] * a3[j] >= l)
				ans++;
		}
	}
	System.out.println(ans);
	}
}