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.*;
import java.io.*;



public class Solution{
    public static void main(String []argh)
    {



        Scanner sc = new Scanner(System.in);
        long m=sc.nextLong();
        long n=sc.nextLong();
        long p2=1,p3=1;
        int cnt=0;
        int cnt1=0;
        while(p2<=n)
        {
            cnt1++; p3=p2*3L;
            while(p3<=n)
            {
                p3*=3L;
                cnt1++;
            }
            p2*=2L;
        }
       // System.out.println(cnt1);
        m--;
        p2=1;
        while(p2<=m)
        {
            cnt++; p3=p2*3L;
            while(p3<=m)
            {
                p3*=3L;
                cnt++;
            }
            p2*=2L;
        }
        System.out.println(cnt1-cnt);
    }
}



