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 = 3.14159265358979323846;
const long long mod = 1e17 + 7;
void unify(vector<long long>& v) {
  auto ip = unique(v.begin(), v.end());
  v.resize(distance(v.begin(), ip));
}
long long gcd(long long x, long long y) { return y == 0 ? x : gcd(y, x % y); }
long long lcm(long long x, long long y) { return x * y / gcd(x, y); }
bool isPower2(long long x) { return x && (!(x & (x - 1))); }
vector<long long> nums;
void init() {
  long long num;
  for (int i = 0; i < 31; i++) {
    num = pow(2, i);
    for (int j = 0; j < 20; j++) {
      if (pow(3, j) > 2e9 / num) continue;
      nums.push_back(num * pow(3, j));
    }
  }
  sort(nums.begin(), nums.end());
  unify(nums);
}
void solve() {
  long long l, r;
  cin >> l >> r;
  int n = nums.size(), cnt = 0;
  for (int i = 0; i < n && nums[i] <= r; i++) {
    if (nums[i] >= l) cnt++;
  }
  cout << cnt << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  init();
  int t = 1;
  while (t--) solve();
}
