#include<stdio.h>
int n,prim[2000001],nr=1,i,j;
void primes(int n)
{
 int i,j;
 for(i=2;i<=n;++i) prim[i]=1;
 for(i=4;i<=n;i+=2) prim[i]=0;
 for(i=3; i*i<=n; i+=2)
	if(prim[i])
		for(j=i*i;j<=n;j+=i) prim[j]=0;
}
int main()
{
 freopen("ciur.in","rt",stdin);
 freopen("ciur.out","wt",stdout);
 scanf("%d",&n);
 for(i=2;i<=n;++i) prim[i]=1;
 for(i=4;i<=n;i+=2) {prim[i]=0; nr++;}
 for(i=3; i*i<=n; i+=2)
	if(prim[i])
		for(j=i*i;j<=n;j+=i) {prim[j]=0; nr++;}
 //for(i=2;i<=n;i++) if(prim[i]) nr++;
 printf("%d",n-nr);
 return 0;
}