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.
ss=readline().split(' ');
var x=0,xh=1,y=0,yh=1;
while(xh<=ss[1]){
	xh=xh*2;
	x++;
}
while(yh<=ss[1]){
	yh=yh*3;
	y++;
}
var i,j,ans=0;
var yy = new Array();
var xx = new Array();
for(i=0; i<=y; i++){
	var hhh=Math.pow(3,i);
	yy.push(hhh);
}
for(i=0; i<=x; i++){
	var hhh=Math.pow(2,i);
	xx.push(hhh);
}
for(i=0; i<=x; i++){
	var r;
	r=xx[i];
	for(j=0; j<=y; j++){
		var t=yy[j],op;
		op=r*t;
		if(op>=ss[0] && op<=ss[1])
			ans++;
		if(op>ss[1])
			break;
		
	}
}
print(ans);




// your code goes here