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;
const int MaxN = 1e6 + 5;
const int Mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const double esp = 1e-6;
int n, ans, k, T;
int main() {
  long long l, r;
  cin >> l >> r;
  long long cnt2 = 1, cnt3 = 1, cnt6 = 1;
  for (int i = 1; i <= 2 * INF; i++) {
    cnt2 *= 2;
    if (cnt2 >= l && cnt2 <= r) {
      ans++;
    } else if (cnt2 > r)
      break;
  }
  for (int i = 1; i <= 32; i++) {
    cnt3 *= 3;
    if (cnt3 >= l && cnt3 <= r) {
      ans++;
    } else if (cnt3 > r)
      break;
  }
  cnt2 = 1;
  for (int i = 1; i <= 32; i++) {
    cnt3 = 1;
    cnt2 *= 2;
    for (int j = 1; j <= 32; j++) {
      cnt3 *= 3;
      if (cnt3 * cnt2 >= l && cnt3 * cnt2 <= r) {
        ans++;
      } else if (cnt3 * cnt2 > r)
        break;
    }
  }
  if (l == 1) ans++;
  cout << ans << endl;
  return 0;
}
