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


public class HashSetExample {
   public static void main(String args[]) {
      // HashSet declaration
      HashSet<Long> s = 
               new HashSet<Long>();
     ArrayList<Long> v2 = new ArrayList<Long>();
     ArrayList<Long> v3 = new ArrayList<Long>();
     
     Scanner sc = new Scanner(System.in);
	int l =sc.nextInt(), r=sc.nextInt();
     
    for (long i = 1; i <= r; i = i * 2) {
        v2.add(i);
        if (i < l) {
            continue;
        }
        s.add(i);
    }
    for (long i = 1; i <= r; i = i * 3) {
        v3.add(i);
        if (i < l) {
            continue;
        }
        s.add(i);
    }
    for (long i = 0; i < v2.size(); ++i) {
        for (int j = 0; j < v3.size(); ++j) {
            Long value = v2.get((int)i) * v3.get((int)j);
            if(value <= r && value >= l) {
                s.add(value);
            }
        }
    }
     
     System.out.println(s.size());

    }
}
