#include "bits/stdc++.h" #include using namespace std; using namespace atcoder; using ll = long long; using vl = vector; using pl = pair; using PQ = priority_queue; using PQR = priority_queue, greater<>>; struct edge {long long to;long long cost;edge(long long t,long long c):to(t),cost(c){}}; using Graph = vector>; using WGraph = vector>; constexpr int dx[8]{1,0,-1,0,1,1,-1,-1}; constexpr int dy[8]{0,1,0,-1,1,-1,1,-1}; #define rep(i, n) for(long long (i) = 0; (i) < (n); (i)++) #define all(v) (v).begin(), (v).end() #define pb emplace_back #define V vector #define uniquify(vec) sort(all(vec)); (vec).erase(std::unique((vec).begin(), (vec).end()), (vec).end()) constexpr long long MOD1 = 1e9 + 7; constexpr long long MOD9 = 998244353; constexpr long long INF = MOD1*MOD1+1; constexpr long long LL_MAX = std::numeric_limits::max(); long long safe_mod(long long n, long long m){if(n >= 0) {return n % m;} else return (n%m + m)%m;} long long div_ceil(long long a, long long b){return (a + b - 1) / b;} long long DIG(long long x, long long d){ll ret=0;while(x){x/=d;ret++;}return ret;} long long pw(long long x,long long n) {ll ret=1;while(n>0){if(n&1){ret=ret*x;}if(n>>=1){x=x*x;}}return ret;} template T SUM(const vector &v){T ret{};return(accumulate(all(v), ret));} template T pwmod(T x, long long n, long long m) {T ret=1;while(n>0){if(n&1)ret=ret*x%m;x=x*x%m;n>>=1;}return ret%m;} template void rsort(vector &v) {sort(all(v), greater());} template bool chmax(T &a,const T& b) {if(a bool chmin(T &a,const T& b) {if(a>b){a=b;return true;}return false;} template void fin(const T &a) {cout << a << '\n';exit(0);} template pair mp(const T &a, const S &b){return make_pair(a, b);} template void unique(vector &a){sort(all(a)); a.erase(std::unique(a.begin(), a.end()), a.end());} template vector compress(vector &a){ int n = a.size(); vector ret(n); vector temp = a; unique(a); for(int i = 0; i < n; i++) ret[i] = lower_bound(a.begin(), a.end(), temp[i]) - a.begin(); return ret; } std::ostream &operator<<(std::ostream& os, const modint1000000007 &m){ os << m.val(); return os; } std::ostream &operator<<(std::ostream& os, const modint998244353 &m){ os << m.val(); return os; } template std::ostream &operator<<(std::ostream& os, const pair &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template std::ostream &operator<<(std::ostream& os, const vector &v){ int n = v.size(); os << "["; for(int i = 0; i < n; i++){ if(i == n - 1) os << v[i]; else os << v[i] << ", "; } os << "]"; return os; } template std::ostream &operator<<(std::ostream& os, const map &mp){ for(auto iter = mp.begin(); iter != mp.end(); iter++){ os << "(" << iter->first << ", " << iter->second << ")" << " "; } return os; } template std::ostream &operator<<(std::ostream& os, const set &s){ os << "{"; for(auto c : s) os << c << " "; os << "}"; return os; } #define LOCAL #ifdef LOCAL #define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl #else #define dump(x) true #endif //using mint = modint1000000007; //using mint = modint998244353; template vector is_prime(T n){ //n以下の非負整数についてエラトステネスの篩を実行する assert(n >= 1); vector ret(n+1, 1); ret[0] = 0; ret[1] = 0; for(ll i = 2; i * i <= n; i++){ if(!ret[i]) continue; for(ll j = i * i; j <= n; j += i) ret[j] = 0; } return ret; } template vector prime_list(T n){ //n以下の素数のリストを返す vector v = is_prime(n); vector ret; rep(i,n+1) if(v[i]) ret.push_back(i); return ret; } template vector divisor(T n){ //nの約数を昇順に並べたvectorを返す vector ret; for(ll i = 1; i * i <= n; i++){ if(n%i == 0){ ret.pb(i); if(i * i != n) ret.pb(n / i); } } sort(all(ret)); return ret; } template vector> prime_factor(T n) { //nの素因数と指数のペアのvectorを返す vector> ret; for (T i = 2; i * i <= n; i++) { if (n % i != 0) continue; T tmp = 0; while (n % i == 0) { tmp++; n /= i; } ret.pb(i, tmp); } if (n != 1) ret.pb(n, 1); return ret; } template vector smallest_factor(T n){ vector ret(n+1); rep(i,n+1) ret[i] = i; for(T i = 2; i * i <= n; i++){ if(ret[i] == i){ for(T j = i * i; j <= n; j += i){ if(ret[j] == j) ret[j] = j; } } } return ret; } void solve(){ ll l, r; cin >> l >> r; vl sq; auto prime = prime_list(1000010); for(auto t: prime){ sq.pb(t * t); if(t * t > 1000010) break; } vl chk(r-l+1, 1); // l+iが素数かどうか for(auto t : sq){ ll s = div_ceil(l, t) * t; for(;s <= r; s += t){ chk[s-l] = 0; } } cout << SUM(chk) << '\n'; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << std::fixed << std::setprecision(15); solve(); return 0; }