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 inf = 987654321;
const int sz = (int)1e6 + 5;
const int mod = (int)1e9 + 7;
const int sqrtn = 300;
long long poww(long long a, long long b) {
  long long ans = 1, c = a;
  while (b) {
    if (b & 1) ans *= c;
    c *= c;
    b >>= 1;
  }
  return ans;
}
long long l, r, ans;
bool vis[40][50];
void dfs(long long x, long long y) {
  if (x > 30 || y > 30 || vis[x][y]) return;
  long long p = poww(3, x) * (1 << y);
  if (p > r) return;
  if (p >= l && p <= r) ans++;
  vis[x][y] = 1;
  dfs(x + 1, y);
  dfs(x, y + 1);
}
int main() {
  cin >> l >> r;
  dfs(0, 0);
  cout << ans << endl;
  return 0;
}
