#include<bits/stdc++.h>
#include<atcoder/all>
namespace my{
using namespace std;
#define eb emplace_back
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define FO(n) for(ll ij=n;ij--;)
#define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))
#define of(i,...) for(auto[i,i##stop,i##step]=range(1,__VA_ARGS__);i>=i##stop;i-=i##step)
#define fe(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):a)
#define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
auto range(bool s,ll a,ll b=1e18,ll c=1){if(b==1e18)b=a,(s?b:a)=0;return array{a-s,b,c};}
constexpr char nl=10;
constexpr char sp=32;
constexpr auto square(auto x){return x*x;}
auto ceil(auto x,auto y){if(y<0)x=-x,y=-y;return x<=0?x/y:(x-1)/y+1;}

auto pop_back(auto&a){assert(a.size());auto r=*a.rbegin();a.pop_back();return r;}

template<class V>concept vectorial=is_base_of_v<vector<typename V::value_type>,V>;
template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}
template<class V>ostream&operator<<(ostream&o,const vector<V>&v){fe(v,e)o<<e<<string(&e!=&v.back(),vectorial<V>?nl:sp);return o;}

template<class V>struct vec:vector<V>{
  using vector<V>::vector;
  vec(const vector<V>&v){vector<V>::operator=(v);}

  vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;}
  vec operator^(const vec&u)const{return vec{*this}^=u;}
  vec&operator++(){fe(*this,e)++e;return*this;}
  vec&operator--(){fe(*this,e)--e;return*this;}
};

void lin(auto&...a){(cin>>...>>a);}
template<char c=sp>void pp(const auto&...a){ll n=sizeof...(a);((cout<<a<<string(--n>0,c)),...);cout<<nl;}

uint64_t kth_root_floor(uint64_t a,ll k){
  if (k==1)return a;
  auto is_within=[&](uint32_t x){uint64_t t=1;fo(k)if(__builtin_mul_overflow(t,x,&t))return false;return t<=a;};

  uint64_t r=0;
  of(i,sizeof(uint32_t)*CHAR_BIT)if(is_within(r|(1u<<i)))r|=1u<<i;
  return r;
}

auto sqrt_floor(auto x){return kth_root_floor(x,2);}
auto cbrt_floor(auto x){return kth_root_floor(x,3);}

vec<ll>prime_enumerate(ll n){
  vec<bool>sieve(n/3+1,1);
  for(ll p=5,d=4,i=1,rn=sqrt_floor(n);p<=rn;p+=d=6-d,i++){
    if(!sieve[i])continue;
    for(ll q=(p*p)/3,r=d*p/3+(d*p%3==2),s=p*2;q<(ll)sieve.size();q+=r=s-r)sieve[q]=0;
  }
  vec<ll>r{2,3};
  for(ll p=5,d=4,i=1;p<=n;p+=d=6-d,i++)if(sieve[i])r.eb(p);
  while(r.size()&&r.back()>n)r.pop_back();
  return r;
}

single_testcase
void solve(){
  LL(L,R);

  vec<ll>v(R-L+1);
  fo(X,L,R+1)v[X-L]=X;

  vec<bool>is_squarefree(R-L+1,1);
  fe(prime_enumerate(cbrt_floor(R)),p){
    fo(X,ceil(L,p)*p,R+1,p){
      if((X/p)%p==0)is_squarefree[X-L]=0;
      else v[X-L]/=p;
    }
  }

  fo(X,L,R+1){
    if(!is_squarefree[X-L])continue;
    ll t=v[X-L];
    if(t==1)continue;
    if(square(sqrt_floor(t))==t)is_squarefree[X-L]=0;
  }

  ll ans=0;
  fo(X,L,R+1)ans+=is_squarefree[X-L];
  pp(ans);
}}