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;
const double pi = acos(-1);
const long long MODPRIMA = (long long)1e9 + 7;
const long long MAXX = (long long)1e18;
const long long MINN = -(long long)1e18;
const double EPS = 1e-9;
void fastscan(int &number) {
  bool negative = false;
  register int c;
  number = 0;
  c = getchar();
  if (c == '-') {
    negative = true;
    c = getchar();
  }
  for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48;
  if (negative) number *= -1;
}
long long L, R;
long long dua[105], tiga[105];
int dd, tt;
void pre() {
  dua[0] = 1;
  for (long long i = 1;; i++) {
    dua[i] = 2 * dua[i - 1];
    if (dua[i] > 2e9) {
      dd = i - 1;
      break;
    }
  }
  tiga[0] = 1;
  for (long long i = 1;; i++) {
    tiga[i] = 3 * tiga[i - 1];
    if (tiga[i] > 2e9) {
      tt = i - 1;
      break;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  pre();
  cin >> L >> R;
  int ans = 0;
  for (int i = 0; i <= tt; i++) {
    for (int j = 0; j <= dd; j++) {
      long long bil = tiga[i] * dua[j];
      if (bil >= L && bil <= R) ans++;
    }
  }
  cout << ans << '\n';
  return 0;
}
