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, a = 0;
long long fast_pow(long long _x, long long _y) {
  long long ans = 1, tmp = _x;
  for (long long i = 0; i < 32; ++i) {
    if (_y & ((long long)1 << i)) ans *= tmp;
    tmp *= tmp;
  }
  return ans;
}
void work(long long digi) {
  bool flag = false;
  for (long long i = 0; i <= digi; ++i) {
    long long tmp =
        fast_pow((long long)2, i) * fast_pow((long long)3, digi - i);
    if (tmp <= r) {
      flag = true;
      if (tmp >= l) ++a;
    }
  }
  if (flag) work(++digi);
}
int main() {
  cin >> l >> r;
  work((long long)0);
  cout << a;
  return 0;
}
