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 codeforce{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        long l = sc.nextLong();
        long r = sc.nextLong();
        long[] d = new long[100];
        long[] t = new long[100];
        int ld=1,lt=1;
        d[0]=1;
        t[0]=1;
        while(d[ld-1]<=r){
            d[ld] = d[ld-1]*2;
            ld++;
        }
        while(t[lt-1]<=r){
            t[lt] = t[lt-1]*3;
            lt++;
        }
        int c=0;
        for(int i=0;i<ld;i++){
            for(int j=0;j<lt;j++){
                if(d[i]*t[j]>=l&&d[i]*t[j]<=r) c++;
            }
        }
        System.out.println(c);
    }
}