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;
using namespace std::chrono;
set<long long> s;
int arr[2];
void go(int i, long long n) {
  if (n > 2 * 1000000000 || i == 2) return;
  s.insert(n);
  go(i, arr[i] * n);
  go(i + 1, n);
}
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  arr[0] = 2, arr[1] = 3;
  go(0, 1);
  int l, r;
  cin >> l >> r;
  vector<long long> v;
  for (auto it : s) v.push_back(it);
  auto c1 = upper_bound(v.begin(), v.end(), r) - v.begin();
  auto c2 = lower_bound(v.begin(), v.end(), l) - v.begin();
  long long ans = c1 - c2;
  cout << ans;
}
