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.Scanner;
import java.util.TreeMap;

public class Main 
{
	static TreeMap<Long, Boolean> map=new TreeMap<Long, Boolean>();
	static int l, r;
	static int count=0;
	public static void main(String[] args) 
	{
		Scanner s=new Scanner(System.in);
		l=s.nextInt();
		r=s.nextInt();
		int min=(int)(Math.log(l)/Math.log(3));
		int max=(int)(Math.log(r)/Math.log(2));
		for(int a=min;a<=max;a++)
		{
			function(a);
		}
		System.out.println(count);
		s.close();
	}
	private static void function(int n)
	{
		for(int a=0;a<=n;a++)
		{
			Long temp=new Double(Math.pow(2, a)*Math.pow(3, n-a)).longValue();
			if(temp>=l&&temp<=r&&map.get(temp)==null)
			{
				count++;
				map.put(temp, true);
			}
		}
	}
}
