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 = 5e3 + 5;
const int inf = 0x3f3f3f3f;
int t, n, k;
long long l, r;
vector<long long> vec1, vec2;
map<long long, bool> vis;
int main() {
  cin >> l >> r;
  long long t = 1LL;
  while (t <= r) {
    vec1.push_back(t);
    t *= 2;
  }
  t = 1LL;
  while (t <= r) {
    vec2.push_back(t);
    t *= 3;
  }
  int Size1 = vec1.size(), Size2 = vec2.size();
  int ans = 0;
  for (int i = 0; i < Size1; ++i) {
    for (int j = 0; j < Size2; ++j) {
      long long a = vec1[i], b = vec2[j];
      long long res = a * b;
      if (l <= res && res <= r && !vis[res]) {
        ++ans;
        vis[res] = true;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
