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 st2[] = {
    1,         2,         4,         8,        16,       32,       64,
    128,       256,       512,       1024,     2048,     4096,     8192,
    16384,     32768,     65536,     131072,   262144,   524288,   1048576,
    2097152,   4194304,   8388608,   16777216, 33554432, 67108864, 134217728,
    268435456, 536870912, 1073741824};
long long st3[] = {1,        3,        9,         27,        81,
                   243,      729,      2187,      6561,      19683,
                   59049,    177147,   531441,    1594323,   4782969,
                   14348907, 43046721, 129140163, 387420489, 1162261467};
int main() {
  long long l, r, v = 0;
  cin >> l >> r;
  for (int i = 0; i < sizeof(st2) / sizeof(long long); i++) {
    for (int j = 0; j < sizeof(st3) / sizeof(long long); j++) {
      if (st2[i] * st3[j] <= r && st2[i] * st3[j] >= l) v++;
    }
  }
  cout << v;
}
