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>
int main() {
  int i, j, need, a, t, c, b, k, l, m, d, h, mi = 0, n, ci = 0;
  double e, g, u, avg;
  int s[1001], ara[1001], tax[1001], me[1001], ke[1001];
  scanf("%d %d", &a, &b);
  for (i = 0; i < 33; i++) {
    for (j = 0; j < 33; j++) {
      e = pow(2, i);
      g = pow(3, j);
      u = e * g;
      if (u >= a && u <= b) {
        mi = mi + 1;
      }
    }
  }
  printf("%d", mi);
  return 0;
}
