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.Scanner;
import java.lang.*;
import java.util.Arrays;
public class sj {
    public static void main(String[] args){
        Scanner inp=new Scanner(System.in);
        int m,i,j,k=0,n,l,r,ans=0;
        l=inp.nextInt();
        r=inp.nextInt();
        long a[]=new long[1100];
        for(i=0;i<32;i++)
            for(j=0;j<32;j++) {
            a[k]=(long)Math.pow(2,i);
            a[k]*=(long)Math.pow(3,j);
            k++;
        }
        Arrays.sort(a,0,k);
        for(i=0;i<k;i++) if(a[i]>=l&&a[i]<=r) ans++;
        System.out.println(ans);
    }
}
