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 buildn(long long a, long long b) {
  long long f = 1;
  for (long long i = 0; i < a; i++) f = f * 2;
  for (long long i = 0; i < b; i++) f = f * 3;
  return f;
}
long long maxn(long long no, long long n) {
  long long c = 1;
  long long i = 0;
  while (c < no) {
    c = c * n;
    i++;
  }
  return i;
}
int main() {
  long long inf, max, va;
  long long nb = 0;
  cin >> inf >> max;
  long long a = maxn(max, 2);
  long long b = maxn(max, 3);
  for (long long i = 0; i < a + 1; i++) {
    for (long long j = 0; j < b + 1; j++) {
      va = buildn(i, j);
      if (!(va > max) && !(va < inf)) nb++;
    }
  }
  cout << nb;
  return 0;
}
