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;

public class project {
    public static long answ(long n) {
        long t2 = 1, t3 = 1, x = 0, y = 0;
        long cnt = 0;
        
        while (t2 <= n) {
            x++;
            t2 *= 2;
        }
        
        cnt += x;
        x--;
        t2 /= 2;
        
        while (t3 <= n) {
            y++;
            t3 *= 3;
            
            while (t2 * t3 > n) {
                x--;
                t2 /= 2;
            }
            
            cnt += x + 1;
        }
        
        return cnt;
    }
    
    public static void main(String[] args) {
    	Scanner s = new Scanner(System.in);
    	
    	long L = s.nextInt(), R = s.nextInt();
    	
    	System.out.println(answ(R) - answ(L - 1));
    }
}