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;
int main() {
  long long l, r, i, c = 0, x = 1, j, s2, s3;
  long long a2[30], a3[20], v2[30], v3[20];
  for (i = 0; i < 30; i++) {
    x *= 2;
    a2[i] = x;
  }
  a3[0] = 1;
  x = 1;
  for (i = 1; i < 20; i++) {
    x *= 3;
    a3[i] = x;
  }
  cin >> l >> r;
  for (i = 0, j = 0; i < 30; i++) {
    if (a2[i] >= l && a2[i] <= r) {
      v2[j] = a2[i];
      j++;
    }
  }
  s2 = j;
  for (i = 0, j = 0; i < 20; i++) {
    if (a3[i] >= l && a3[i] <= r) {
      v3[j] = a3[i];
      j++;
    }
  }
  s3 = j;
  for (i = 1; i < 20; i++) {
    for (j = 0; j < 30; j++) {
      x = a2[j] * a3[i];
      if (x >= l && x <= r) {
        c++;
      }
    }
  }
  c += s2 + s3;
  cout << c;
  return 0;
}
