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;
using ll = long long;
using ull = unsigned long long;
using ldb = long double;
const int N = 100500 * 1;
const double eps = 1e-11;
const int mod = 1020421001;
const int inf = numeric_limits<int>::max();
int a[N];
ull pows[2][40];
int main() {
  pows[0][0] = pows[1][0] = 1;
  for (int i = 1; i < (int)(40); ++i) {
    pows[0][i] = pows[0][i - 1] * 2;
    pows[1][i] = pows[1][i - 1] * 3;
  }
  int l, r;
  cin >> l >> r;
  int cnt = 0;
  for (int i = 0; i < 40; ++i) {
    for (int j = 0; j < 40; ++j) {
      if (pows[0][i] > r || pows[1][j] > r) break;
      ull pw = pows[0][i] * pows[1][j];
      if (pw >= l && pw <= r) ++cnt;
    }
  }
  cout << cnt;
  return 0;
}
