#include <bits/stdc++.h>
using namespace std;
long long a[10000];
long long pow(int x, int i) {
  long long ans = 1;
  while (i) {
    if (i & 1) ans *= x;
    i /= 2;
    x = x * x;
  }
  return ans;
}
int main() {
  int count = 0;
  for (int i = 0; i <= 31; i++)
    for (int j = 0; j <= 20; j++) {
      long long ans = 1;
      ans *= pow(2, i);
      ans *= pow(3, j);
      if (ans <= 2000000000) a[count++] = ans;
    }
  sort(a, a + count);
  int l, r;
  while (cin >> l >> r) {
    int l1 = 0, r1 = count - 1, ok = 0;
    if (l > a[count - 1]) ok = 1;
    for (int i = 0; i < count; i++) {
      if (l > a[i] && r < a[i + 1]) ok = 1;
    }
    if (ok) {
      cout << 0 << endl;
      continue;
    }
    for (int i = 0; i < count; i++)
      if (a[i] >= l) {
        l1 = i;
        break;
      }
    for (int i = 0; i < count; i++)
      if (a[i] > r) {
        r1 = i - 1;
        break;
      }
    cout << (r1 - l1 + 1) << endl;
  }
}
