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;
bool comp(int a, int b) { return (a < b); }
bool compf(const pair<int, int>& a, const pair<int, int>& b) {
  return (a.first < b.first);
}
int max(int a, int b) {
  if (a > b) return a;
  return b;
}
long long min(long long a, long long b) {
  if (a < b) return a;
  return b;
}
long long power(long long a, int x) {
  while (x--) {
    a *= a;
  }
  return a;
}
int main() {
  vector<long long> m;
  long long big = 2 * 1000000000;
  for (int i = 0; i < 31; i++)
    for (int j = 0; j < 21; j++)
      if (pow(2, i) * pow(3, j) > big)
        break;
      else
        m.push_back(pow(2, i) * pow(3, j));
  sort(m.begin(), m.end());
  int ans = 0, l, r;
  cin >> l >> r;
  for (int i = 0; i < m.size(); i++)
    if (m[i] >= l)
      if (m[i] <= r)
        ans++;
      else
        break;
  cout << ans;
}
