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 long long mod = 1e9 + 7;
const long long MOD = 998244353;
inline long long add(long long x, long long y) {
  x += y;
  if (x >= mod) x -= mod;
  return x;
}
inline long long sub(long long x, long long y) {
  x -= y;
  if (x < 0) x += mod;
  return x;
}
inline long long mul(long long x, long long y) { return (x * 1ll * y) % mod; }
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
vector<long long> adj[200100];
long long subtr[200100];
long long vis[200100];
long long ord[200100];
long long pos[200100];
long long t = 0;
long long dfs(long long n) {
  long long ans = 0;
  vis[n] = 1;
  pos[n] = t;
  ord[t] = n;
  t++;
  for (auto it : adj[n])
    if (!vis[it]) ans += dfs(it);
  return subtr[n] = ans + 1;
}
signed main() {
  long long l, r;
  cin >> l >> r;
  long long ans = 0, p = 1;
  for (long long i = 1; i <= r; i *= 2) {
    p = i;
    while (p <= r) {
      if (p >= l) ans++;
      p *= 3;
    }
  }
  cout << ans;
}
