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.math.BigInteger;
import java.util.*;
import java.util.function.BinaryOperator;


public class Main {
    public static void main(String[] args) {
            new FF().Hi();
    }

    static class FF{
        final Scanner sc;
        BigInteger l , r;
        public FF() {
             sc=  new Scanner(System.in);
        }

        void Hi(){
            l = sc.nextBigInteger();
            r = sc.nextBigInteger();
            long ans = 0;
            for (int i = 0; i < 32; i++) {
                BigInteger p = new BigInteger(String.valueOf((long) Math.pow(2, i)));
                int cmp  = p.compareTo(r);
                if(cmp ==1) break;
                for (int j = 0; j < 21; j++) {
                    BigInteger q =  new BigInteger(String.valueOf((long) Math.pow(3, j)));
                    BigInteger oo = new BigInteger(String.valueOf(q.multiply(p)));
                    int cmpo = oo.compareTo(l);
                    int cmpt = oo.compareTo(r);
                    if(cmpo>=0 && cmpt<=0)ans++;

                }
            }
            System.out.println(ans);
        }
    }
}