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;
vector<long long> v;
long long dp2[40];
long long dp3[40];
int main() {
  long long l, r;
  v.push_back(1);
  cin >> l >> r;
  v.push_back(2);
  v.push_back(3);
  dp2[0] = 2;
  dp3[0] = 3;
  for (int i = 1; i <= 31; i++) {
    dp2[i] = dp2[i - 1] * 2;
    v.push_back(dp2[i]);
  }
  for (int i = 1; i <= 20; i++) {
    dp3[i] = dp3[i - 1] * 3;
    v.push_back(dp3[i]);
  }
  long long tmp;
  for (int i = 0; i <= 31; i++) {
    for (int j = 0; j <= 20; j++) {
      tmp = dp2[i] * dp3[j];
      if (tmp < 2000000000 && tmp > 0) v.push_back(tmp);
    }
  }
  sort(v.begin(), v.end());
  auto le = lower_bound(v.begin(), v.end(), l);
  auto ri = lower_bound(v.begin(), v.end(), r + 1);
  long long ans = ri - le;
  cout << ans << endl;
}
