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;
set<long long int> find() {
  long long int i, num = 1, j, arr2[31], arr3[20];
  for (i = 0; i <= 30; ++i) {
    arr2[i] = num;
    num *= 2;
  }
  num = 1;
  for (i = 0; i <= 19; ++i) {
    arr3[i] = num;
    num *= 3;
  }
  set<long long int> s1;
  for (i = 0; i <= 30; ++i) {
    for (j = 0; j <= 19; ++j) {
      if (arr2[i] * arr3[j] <= 2 * 1000000000) {
        s1.insert(arr2[i] * arr3[j]);
      }
    }
  }
  return s1;
}
int main() {
  long long int l, r, ans = 0;
  cin >> l >> r;
  set<long long int> s1;
  s1 = find();
  set<long long int>::iterator it;
  for (it = s1.begin(); it != s1.end(); ++it) {
    if (*it >= l && *it <= r) {
      ++ans;
    }
  }
  cout << ans << endl;
  return 0;
}
