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>
using namespace std;
long long l, r, _, ans, k, na, nb, cnt, a[50], b[50], f[333];
void pretype() {
  k = 1;
  while (k <= 2000000000ll) a[na++] = k, k *= 2;
  k = 1;
  while (k <= 2000000000ll) b[nb++] = k, k *= 3;
  for (long long i = 0; i < na; i++)
    for (long long j = 0; j < nb; j++)
      if (a[i] * b[j] > 2000000000ll)
        break;
      else
        f[++cnt] = a[i] * b[j];
  f[++cnt] = 2000000001ll;
}
int main() {
  pretype();
  sort(f + 1, f + cnt + 1);
  scanf("%I64d%I64d", &l, &r);
  while (f[_] < l) _++;
  ans = _;
  while (f[_] <= r) _++;
  ans = _ - ans;
  printf("%I64d\n", ans);
  return 0;
}
