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 int N = 1 << 17;
const double PI = acos(-1);
struct io {
  io() {
    ios::sync_with_stdio(0);
    cin.tie();
    cout.precision(8);
  }
} _______;
int main() {
  long long l, r;
  cin >> l >> r;
  long long p = 3;
  vector<long long> p2, p3;
  for (long long i = 1; (1ll << i) <= r; i++) {
    p2.push_back(1ll << i);
  }
  for (int i = 1; p <= r; i++) {
    p3.push_back(p);
    p *= 3;
  }
  int ans = (l == 1);
  for (int i = 0; i < (int)p2.size(); i++) {
    if (p2[i] <= r) {
      if (p2[i] >= l) {
        ans++;
      }
      for (int j = 0; j < (int)p3.size(); j++) {
        if (l <= p2[i] * p3[j]) {
          if (p2[i] * p3[j] <= r) {
            ans++;
          } else {
            break;
          }
        }
      }
    }
  }
  for (int i = 0; i < (int)p3.size(); i++) {
    if (p3[i] >= l && p3[i] <= r) ans++;
  }
  cout << ans;
  return 0;
}
