#include <bits/stdc++.h>
using namespace std;
set<long long int> find() {
  long long int i, num = 1, j, arr2[31], arr3[20];
  for (i = 0; i <= 30; ++i) {
    arr2[i] = num;
    num *= 2;
  }
  num = 1;
  for (i = 0; i <= 19; ++i) {
    arr3[i] = num;
    num *= 3;
  }
  set<long long int> s1;
  for (i = 0; i <= 30; ++i) {
    for (j = 0; j <= 19; ++j) {
      if (arr2[i] * arr3[j] <= 2 * 1000000000) {
        s1.insert(arr2[i] * arr3[j]);
      }
    }
  }
  return s1;
}
int main() {
  long long int l, r, ans = 0;
  cin >> l >> r;
  set<long long int> s1;
  s1 = find();
  set<long long int>::iterator it;
  for (it = s1.begin(); it != s1.end(); ++it) {
    if (*it >= l && *it <= r) {
      ++ans;
    }
  }
  cout << ans << endl;
  return 0;
}
