#include<stdio.h>
int n,cnt=0;
char *Prim;//Prime[i]==1 => Prime[i] nu e prim

void pregateste()
{
FILE *pin=fopen("ciur.in","r");
fscanf(pin,"%d",&n);
Prim=new char[n/16+1];
for(int i=0;i<=n/16+1;i++)
fclose(pin);}

void rezolva()
{long long int i,j;
for(i=3;i<=n;i+=2)
  if(( Prim[i/16] & (1<<(i/2%8)))==0)
    {
    cnt++;
    for(j=i*i;j<=n;j+=i*2)
      Prim[j/16]|=(1<<(j/2%8));
    }
}

void incheie()
{delete []Prim;
FILE *pout=fopen("ciur.out","w");
fprintf(pout,"%d",cnt+1);
fclose(pout);}

int main()
{
pregateste();
rezolva();
incheie();
return 0;
}