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 long long mod = 1e9 + 7;
const int nmax = 2e5;
set<long long> s;
void build() {
  s.insert(1);
  vector<long long> pot2, pot3;
  long long a = 1;
  for (int i = 0; i < 30; ++i) {
    a *= 2LL;
    pot2.push_back(a);
    s.insert(a);
  }
  a = 1;
  for (int i = 0; i < 19; ++i) {
    a *= 3LL;
    pot3.push_back(a);
    s.insert(a);
  }
  for (int i = 0; i < 30; ++i)
    for (int j = 0; j < 19; ++j) s.insert(pot2[i] * pot3[j]);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  build();
  long long l, r;
  cin >> l >> r;
  auto i = s.lower_bound(l);
  auto j = s.upper_bound(r);
  int ans = distance(i, j);
  cout << ans << endl;
  return 0;
}
