#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	ll a, b;
	cin >> a >> b;

	vector <int> primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};

	vector <ll> dp(1 << 20, 0);
	dp[0] = 1;
	for(ll x = a; x <= b; x++) {
		int curr_mask = 0;
		for(int i = 0; i < 20; i++) {
			if(x % primes[i] == 0) curr_mask |= (1 << i);
		}

		for(int mask = 0; mask < (1 << 20); mask++) {
			if(mask & curr_mask) continue;
			dp[mask ^ curr_mask] += dp[mask];
		}
	}
	cout << accumulate(dp.begin(), dp.end(), 0LL);
}
#include <bits/stdc++.h>
using namespace std;

template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
 
void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define fi first
#define se second
#define pb push_back
#define mod(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,a,b) for(int i = a; i < b; i++)
#define forr(i,a,b) for(int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;

const ll mod = 1e9+7;
int sum(int a, int b){return (a+b) % mod;}
int sub(int a, int b){return (a + mod - b) % mod;}
int mul(int a, int b){return (1ll * a * b) % mod;}
int power(int a,int b){
	int res = 1;
	while(b){
		if(b&1)res = mul(res,a);
		b >>= 1;
		a = mul(a,a);
	}
	return res;
}
const int maxn = 73;
const int maxp = 21;
vector<int> primos;
vector<pair<ll,int>> C;
ll A,B,dp[2][(1<<maxp)];

//ll dp(int pos,int mask){
	//if(pos >= (int)C.size())return 1;
	//ll &res = memo[pos][mask];
	//if(res != -1)return res;
	//res = dp(pos+1,mask);
	//if(!(mask&C[pos].se)){
		//res += dp(pos+1,mask|C[pos].se);
	//}
	//return res;
//}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	forn(i,2,maxn){
		bool primo = true;
		forn(j,2,i)if(i%j == 0)primo = false;
		if(primo)primos.pb(i);
	}
	cin >> A >> B;
	for(ll i = A; i <= B; i++){
		int mask = 0;
		forn(j,0,(int)primos.size()){
			ll p = primos[j];
			if(i%p == 0)mask |= (1<<j);
		}
		C.pb({i,mask});
	}
	//debug(primos);
	//debug(C);
	forn(mask,0,(1<<maxp))dp[1][mask] = 1;
	forr(pos,(int)C.size()-1,0){
		forn(mask,0,(1<<maxp)){
			dp[0][mask] += dp[1][mask];
			if(!(mask&C[pos].se)){
				dp[0][mask] += dp[1][mask|C[pos].se];
			}
		}
		forn(mask,0,(1<<maxp)){
			dp[1][mask] = dp[0][mask];
			dp[0][mask] = 0;
		}
	}
	ll res = dp[1][0];
	//debug(dp[1][0],dp[1][C[0].se]);
	//forn(mask,0,(1<<maxp))res += dp[1][mask];
	cout << res << '\n';
	
	return 0;
}
/*
__builtin_mul_overflow(x,y,&x)
-fsplit-stack
*/
