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.io.*;
import java.util.ArrayList;
import java.util.Scanner;

public class CodeForce
{
	public static void main(String args[])
	{
		Scanner input = new Scanner(System.in);
		int l = input.nextInt();
		int r = input.nextInt();
		ArrayList<Long> list = new ArrayList<>();
		for (int i = 0; i <= 30; i++)
		{
			for (int j = 0; j <= 19; j++)
			{
				long z = power(2, i) * power(3, j);
				if (z < 2000000000)
				{
					list.add(z);
				}
			}
		}
		int count = 0;
		for (int i = 0; i < list.size(); i++)
		{
			long z = list.get(i);
			if (l <= z && z <= r)
			{
				count++;
			}
		}
		System.out.println(count);
	}

	public static long power(long a, long b)
	{
		long result = 1;
		while (b > 0)
		{
			if (b % 2 != 0)
			{
				result = result * a;
				b--;
			}
			a = a * a;
			b /= 2;
		}

		return result;
	}
}