#include <fstream>

using namespace std;
long  long i,j,n,m,x,y,p,l,d;
 short int k[8]={2,3,5,7,11,13,17,19};
bool prim[1000001];
int main()
{
ifstream f("paisprezece.in");
ofstream g("ciur.out");
 //  f>>x>>y;
 x=1;y=64000000;
for(int i=2;i<=1000001;++i)
  if (prim[i]==0){
        for(d=0;d<=7;d++)
   { p=k[d]*k[d]*k[d]*k[d]*k[d]*k[d];
    if(k[d]!=i)
    if(p*i>=x and p*i<=y) l++;
   }
   for(int j=i*2;j<=1000001;j+=i)
     prim[j]=1;}
   if(x<=8192 and y>=8192) l++;
   if(x<=1594323 and y>=1594323) l++;
   g<<l;


    return 0;
}