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;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int l, r, res = 0;
  cin >> l >> r;
  vector<unsigned long long> two, three, temp;
  for (int i = 0; i < 31; ++i) {
    two.push_back(1LL << i);
    if (i > 19) continue;
    three.push_back(pow(3LL, i));
  }
  for (int i = 0; i < two.size(); ++i) {
    for (int j = 0; j < three.size(); ++j) {
      if (two[i] * three[j] <= 2000000000LL) temp.push_back(two[i] * three[j]);
    }
  }
  sort(temp.begin(), temp.end());
  res = upper_bound(temp.begin(), temp.end(), r) -
        lower_bound(temp.begin(), temp.end(), l);
  cout << res;
  return 0;
}
