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.
var arr = readline().split(" ").map(v => +v.trim());
var l = arr[0], r = arr[1];
var res = 0;
var p = {}
for(var i=0;i<32;i++){
    for(var j = 0;j<32;j++){ 
        var n = 1;
        var k = i;
        while(k--){
            if(n*2<=2000000000)
                n*=2;
              
        }
        k = j;
        while(k--){
            if(n*3<=2000000000)
                n*=3;
        }
        if(n>=l && n<=r && !p[n]){res++;p[n]=1;}
        // print(n);
    }
}

print(res);