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.
#include <bits/stdc++.h>
long long l, r;
int main() {
  scanf("%d %d", &l, &r);
  long long two = 1;
  long long th = 1;
  long long a_2[10000];
  long long a_3[10000];
  a_2[0] = 1;
  a_3[0] = 1;
  for (int i = 1; i < 10000; i++) {
    if (a_2[i - 1] < r) a_2[i] = 2 * a_2[i - 1];
    if (a_3[i - 1] < r) a_3[i] = 3 * a_3[i - 1];
  }
  int n = 10000;
  int answer = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (a_2[i] * a_3[j] <= r && a_2[i] * a_3[j] >= l) {
        answer++;
      } else if (a_2[i] * a_3[j] > r)
        break;
    }
  }
  printf("%d", answer);
  return 0;
}
