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 l, r;
vector<long long int> tt;
void generate() {
  long long int x = 2;
  int idx;
  tt.push_back(1);
  while (x <= 2000000000ll) {
    tt.push_back(x);
    x *= 2;
  }
  idx = tt.size();
  x = 3;
  while (x <= 2000000000ll) {
    tt.push_back(x);
    x *= 3;
  }
  int i, j;
  int n = tt.size();
  for (i = 1; i < idx; i++) {
    for (j = idx; j < n; j++) {
      if (tt[i] * tt[j] > 2000000000ll) break;
      tt.push_back(tt[i] * tt[j]);
    }
  }
}
void solve() {
  int ans = 0;
  for (long long int x : tt) {
    if (x >= l && x <= r) ans++;
  }
  cout << ans << "\n";
}
int main() {
  cin >> l >> r;
  generate();
  solve();
  return 0;
}
