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() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int a, b;
  cin >> a >> b;
  vector<long long int> m;
  vector<long long int> n;
  set<long long int> s;
  m.push_back(1);
  n.push_back(1);
  if (a == 1) s.insert(1);
  for (long long int i = 1; i <= b;) {
    i = i * 2;
    m.push_back(i);
    if (i >= a && i <= b) s.insert(i);
  }
  for (long long int i = 1; i <= b;) {
    i = i * 3;
    n.push_back(i);
    if (i >= a && i <= b) s.insert(i);
  }
  for (int i = 0; i < m.size(); i++) {
    for (int j = 0; j < n.size(); j++) {
      long long int x = m[i] * n[j];
      if (x >= a && x <= b) {
        s.insert(x);
      }
    }
  }
  cout << s.size() << endl;
}
