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;
void rec(vector<unsigned int>& arr, unsigned int ind) {
  if (ind < 700000000) {
    arr.push_back(ind * 3);
    rec(arr, ind * 3);
    while (ind < 1000000000) {
      arr.push_back(ind * 2);
      ind *= 2;
    }
    return;
  }
  while (ind < 1000000000) {
    arr.push_back(ind * 2);
    ind *= 2;
  }
  return;
}
int main() {
  int a, b;
  int ans = 0;
  vector<unsigned int> arr;
  arr.push_back(1);
  scanf("%d", &a);
  scanf("%d", &b);
  rec(arr, 1);
  std::sort(arr.begin(), arr.end());
  for (int i = 0; i < arr.size(); i++) {
    if (arr[i] <= b && arr[i] >= a) {
      ans++;
    }
  }
  printf("%d\n", ans);
  return 0;
}
