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 long long mod = 998244353;
const int nax = 200005;
const long long inf = 2e9;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  vector<long long> vek;
  long long l, r;
  cin >> l >> r;
  long long now = 1;
  while (now <= inf) {
    long long cur_now = now;
    while (cur_now <= inf) {
      vek.push_back(cur_now);
      cur_now *= 3;
    }
    now *= 2;
  }
  sort(vek.begin(), vek.end());
  long long a = lower_bound(vek.begin(), vek.end(), l) - vek.begin();
  long long b = lower_bound(vek.begin(), vek.end(), r) - vek.begin();
  long long ans = b - a - 1;
  if (vek[a] >= l && vek[a] <= r) ans++;
  if (vek[b] >= l && vek[b] <= r) ans++;
  cout << max(ans, 0LL) << '\n';
  return 0;
}
