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 int M = 2e9 + 5;
vector<long long> v, u, vv;
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long a = 2, b = 3;
  vv.push_back(1);
  while (a <= M) {
    v.push_back(a);
    vv.push_back(a);
    a <<= 1LL;
  }
  while (b <= M) {
    u.push_back(b);
    vv.push_back(b);
    b *= 3LL;
  }
  for (auto i : v)
    for (auto j : u) vv.push_back(i * j);
  sort(vv.begin(), vv.end());
  unique(vv.begin(), vv.end());
  int l, r;
  cin >> l >> r;
  int x = lower_bound(vv.begin(), vv.end(), l) - vv.begin();
  int y = upper_bound(vv.begin(), vv.end(), r) - vv.begin();
  cout << y - x;
  return 0;
}
