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>
const int inf = (int)2e+9 + 2;
const int mod = 9123456789;
const double eps = 1e-8;
const long long maxn = 2e+9;
using namespace std;
vector<int> a;
void rec(long long x) {
  if (x > maxn) return;
  a.push_back(x);
  if (x % 3) rec(x * 2);
  rec(x * 3);
}
int main() {
  rec(1);
  sort(a.begin(), a.end());
  int l, r;
  cin >> l >> r;
  int ll = lower_bound(a.begin(), a.end(), l) - a.begin();
  int rr = upper_bound(a.begin(), a.end(), r) - a.begin();
  cout << rr - ll;
}
