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;
long long l, r;
vector<long long> dv;
vector<long long> tr;
long long f2 = 1;
long long f3 = 1;
map<long long, long long> used;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> l >> r;
  for (;;) {
    if (f2 > r) break;
    dv.push_back(f2);
    f2 *= 2;
  }
  for (;;) {
    if (f3 > r) break;
    tr.push_back(f3);
    f3 *= 3;
  }
  long long ans = 0;
  for (int i = 0; i < dv.size(); i++)
    for (int j = 0; j < tr.size(); j++) {
      long long a = dv[i];
      long long b = tr[j];
      if (a >= l && a <= r && used[a] == 0) {
        used[a] = 1;
        ans++;
      }
      if (b >= l && b <= r && used[b] == 0) {
        used[b] = 1;
        ans++;
      }
      long long c = a * b;
      if (c >= l && c <= r && used[c] == 0) {
        used[c] = 1;
        ans++;
      }
    }
  cout << ans << endl;
}
