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 int Max(long long int a, long long int b) {
  if (a > b) {
    return a;
  } else {
    return b;
  }
}
long long int Min(long long int a, long long int b) {
  if (a > b) {
    return b;
  } else {
    return a;
  }
}
int main() {
  long long int a, b;
  while (scanf("%lld %lld", &a, &b) == 2) {
    long long int res = 0, temp, i, j, counter = 0, temp1, Mx, Mn, sqrtl;
    Mx = Max(a, b);
    Mn = Min(a, b);
    long long int r = 0;
    for (i = 0;; i += 1) {
      temp = powl(2, i);
      for (j = 0;; j += 1) {
        temp1 = powl(3, j);
        res = temp * temp1;
        if (res > Mx) break;
        if (res <= Mx && res >= Mn) {
          counter += 1;
        }
      }
      if (temp >= Mx) break;
    }
    printf("%lld\n", counter);
  }
  return 0;
}
