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

public class Pro
{
    public static void main(String[] args)
    {
        Scanner cin = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int a = cin.nextInt();
        int b = cin.nextInt();
        int q = 0;
        for(int i = 0; i < 40; i++)
        {
            for(int j = 0; j < 40; j++)
            {
                long kk = 1;
                for (int x = 0; x < i; x++)
                {
                    kk = kk * 2;
                }
                for (int y = 0; y < j; y++)
                {
                    kk = kk * 3;
                    if (kk > 2000000000)
                        break;
                }
                //out.println(kk);
                if (a <= kk && kk <= b)
                    q++;
            }
        }
        out.println(q);
        out.flush();
    }
}