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;
long long int A[200007], B[10000], C[10000];
long long int aa(long long int M) {
  long long int c, k, i, t, x, y, z, j, b, s, T, V, F, f, a, m, n, p, N;
  s = 0;
  N = 2;
  while (N <= M) {
    N = N * 2;
    s++;
  }
  N = 3;
  while (N <= M) {
    N = N * 3;
    s++;
  }
  N = 6;
  A[0] = 6;
  a = 1;
  while (N <= M) {
    N = N * 6;
    A[a] = N;
    a++;
    s++;
  }
  for (i = 0; i < a; i++) {
    N = A[i] * 2;
    while (N <= M) {
      N = N * 2;
      s++;
    }
    N = A[i] * 3;
    while (N <= M) {
      N = N * 3;
      s++;
    }
  }
  return s;
}
int main() {
  long long int c, k, i, t, x, y, z, j, N, M, b, s, T, V, F, f, a, K, m, n, p,
      X, Y;
  cin >> N >> M;
  N = N - 1;
  x = aa(N);
  y = aa(M);
  z = y - x;
  if (N == 0) {
    z++;
  }
  cout << z << endl;
  return 0;
}
