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;

public class numbers23 {

    public static void main(String args[]) {
        Scanner scan = new Scanner(System.in);
        int a = scan.nextInt();
        int b = scan.nextInt();
        HashSet<Integer> h = new HashSet<Integer>();
        for (int j = 0; Math.pow(2, j) <= b; j++) {
            if (Math.pow(2, j) >= a && Math.pow(2, j) <= b) {
                h.add((int) Math.pow(2, j));
            }
            if (Math.pow(3, j) >= a && Math.pow(3, j) <= b) {
                h.add((int) Math.pow(3, j));
            }

        }
        for (int i = 0; Math.pow(2, i) <= b; i++) {
            for (int j = 0; Math.pow(3, j) <= b; j++) {
                if (Math.pow(3, j) * Math.pow(2, i) >= a && Math.pow(3, j) * Math.pow(2, i) <= b) {
                    h.add((int) Math.pow(3, j) * (int) Math.pow(2, i));
                }
            }

        }
        System.out.println(h.size());

    }
}
