#pragma region Macros

#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
// using namespace __gnu_cxx;

// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// using Bint = mp::cpp_int;

#define TO_STRING(var) # var
#define pb emplace_back
#define int ll
#define endl '\n'

using ll = long long;
using ld = long double;
const ld PI = acos(-1);
const ld EPS = 1e-10;
const int INF = 1 << 30;
const ll INFL = 1LL << 61;
// const int MOD = 998244353;
const int MOD = 1000000007;

__attribute__((constructor))
void constructor() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    cout << fixed << setprecision(15);
}

template<int mod> class modint{
public:
    int val = 0;
    modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }
    modint(const modint &r) { val = r.val; }

    modint operator -() { return modint(-val); }
    modint operator +(const modint &r) { return modint(*this) += r; }
    modint operator -(const modint &r) { return modint(*this) -= r; }
    modint operator *(const modint &r) { return modint(*this) *= r; }
    modint operator /(const modint &r) { return modint(*this) /= r; }

    modint &operator +=(const modint &r) {
        val += r.val;
        if (val >= mod) val -= mod;
        return *this;
    }
    modint &operator -=(const modint &r) {
        if (val < r.val) val += mod;
        val -= r.val;
        return *this;
    }
    modint &operator *=(const modint &r) {
        val = val * r.val % mod;
        return *this;
    }
    modint &operator /=(const modint &r) {
        int a = r.val, b = mod, u = 1, v = 0;
        while (b) {
            int t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % mod;
        if (val < 0) val += mod;
        return *this;
    }

    bool operator ==(const modint& r) { return this -> val == r.val; }
    bool operator <(const modint& r) { return this -> val < r.val; }
    bool operator !=(const modint& r) { return this -> val != r.val; }
};

using mint = modint<MOD>;

istream &operator >>(istream &is, mint& x) {
    int t; is >> t;
    x = t;
    return (is);
}
ostream &operator <<(ostream &os, const mint& x) {
    return os << x.val;
}

mint modpow(const mint &a, int n) {
    if (n == 0) return 1;
    mint t = modpow(a, n / 2);
    t = t * t;
    if (n & 1) t = t * a;
    return t;
}

int modpow(int x, int n, int mod) {
    int ret = 1;
    while (n > 0) {
        if (n % 2 == 1) ret = ret * x % mod;
        x = x * x % mod;
        n /= 2;
    }
    return ret;
}

int ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }

#pragma endregion

vector<bool> erat(int n) {

    vector<bool> prime(n + 1, true);
    prime[0] = false;
    if (n >= 1) prime[1] = false;

    for (int i = 2; i * i <= n; i++) {
        if (prime[i]) {
            for (int j = i + i; j <= n; j += i) {
                prime[j] = false;
            }
        }
    }

    return prime;
}

signed main() {
	int L, R;
    cin >> L >> R;

    vector<bool> E = erat(1e6);
    vector<int> P;
    for (int i = 2; i < 1e6; i++) {
        if (E[i]) P.pb(i);
    }
    int sz = P.size();

    vector<int> A(R - L + 1);
    for (int i = 0; i < R - L + 1; i++) {
        A[i] = L + i;
    }

    for (int i = 0; i < R - L + 1; i++) {
        for (int j = 0; j < sz; j++) {
            if (P[j] > A[i]) break;
            int cnt = 0;
            while (A[i] % P[j] == 0 && cnt < 2) {
                A[i] /= P[j];
                cnt++;
            }
            if (cnt >= 2) A[i] = -1; // 平方数で割り切れる
        }
    }

    int ans = 0;
    for (int i = 0; i < R - L + 1; i++) {
        if (A[i] == -1) continue;
        if (A[i] == 1) ans++;
        else {
            int p = round(sqrt(A[i]));
            if (p * p == A[i]) continue;
            ans++;
        }
    }
    cout << ans << endl;
}