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> s;
void f() {
  int k = 0;
  queue<long long> que;
  que.push(1);
  s.insert(1);
  set<long long>::iterator it = s.begin();
  long long temp = *it;
  while (temp <= 2e9) {
    long long t = *it;
    if (t * 2 <= 2000000000) {
      s.insert(t * 2);
    }
    if (t * 3 <= 2000000000) {
      s.insert(t * 3);
    }
    temp = t * 3;
    it++;
  }
}
int main() {
  f();
  long long a, b;
  while (cin >> a >> b) {
    int sum = 0;
    set<long long>::iterator it;
    for (it = s.begin(); it != s.end(); ++it) {
      if (*it >= a && *it <= b) sum++;
    }
    cout << sum << endl;
  }
  return 0;
}
