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 Sol {
  public static long powerN(int number, int power) {
    return (long) Math.pow(number, power);
  }
  
	public static void main(String[] argc){
	   ArrayList<Long> al = new ArrayList<Long>();
		Scanner sc = new Scanner(System.in);
		int l = sc.nextInt();
		int r = sc.nextInt();
		for (int i = 0; i < 33; i++) {
		  for (int j = 0; j + i < 33; j++) {
		    Long v =  (Long) powerN(2, i) * powerN(3, j);
		    al.add(v);
		  }
		}
		Collections.sort(al);
		int cnt = 0;
		for (Long v: al) {
		  if (v >= l && v <= r)
		    cnt++;
		}
		System.out.println(cnt);
	}
}