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.
//package algoprog.level3.d.a;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class T23Numbers {

    public static void main(String[] args) throws IOException {
        final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        final StringTokenizer st = new StringTokenizer(br.readLine());

        int l = Integer.parseInt(st.nextToken());
        int r = Integer.parseInt(st.nextToken());

        List<Integer> twos = new ArrayList<>();
        Set<Long> all = new HashSet<>();

        long cur = 1;
        while (cur <= r) {
            twos.add((int) cur);
            if (cur >= l && cur <= r) {
                all.add(cur);
            }
            cur *= 2;
        }

        cur = 3;
        while (cur <= r) {
            for (Integer two : twos) {
                final long next = cur * two;
                if (toAdd(next, l, r, all)) {
                    all.add(next);
                } else if (next > r) {
                    break;
                }
            }
            if (toAdd(cur, l, r, all)) {
                all.add(cur);
            }

            cur *= 3;
        }

        System.out.println(all.size());
    }

    private static boolean toAdd(long next, int l, int r, Set<Long> set) {
        return next >= l && next <= r && !set.contains(next);
    }

}