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

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int l = in.nextInt();
        int r = in.nextInt();
        ArrayList <Long> arrayList = new ArrayList<Long>();
        for (int i = 0; i <= 30; i++) {
            long tmp = (1 << i);
            //arrayList.add(tmp);
            //System.out.println(tmp);
            for (long j = tmp; j <= 2e9 + 20; j *= 3)
                arrayList.add(j);
        }
        long a = 0;
        for (long i : arrayList)
            if (i < l)
                a++;
        long b = 0;
        for (long i : arrayList)
            if (i <= r)
                b++;
        System.out.println(b - a);
    }
}