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.*;
public class A926 {
	

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		HashSet<Long> set=new HashSet<>();
		long l=sc.nextLong();
		long r=sc.nextLong();
		long a[]=new long[1000];
		int k=1;
		a[0]=1;
		int i=0;
		while(true){
			
				
			if(a[i]*2<=2000000000l&&!(set.contains(a[i]*2))){
				set.add(a[i]*2);
				a[k++]=a[i]*2;
			}
			if(a[i]*3<=2000000000l&&!(set.contains(a[i]*3))){
				set.add(a[i]*3);
				a[k++]=a[i]*3;
			}
			i++;
			if(i==k)
				break;
		}
		int cnt=0;
		for( i=0;i<k;i++){
			if(a[i]>=l&&a[i]<=r)
				cnt++;
		}
		System.out.println(cnt);
			
	}
}