// ciurul lui Eratostene
#include <stdio.h>
bool prim[2000000];

int ciur(long n)
{
	long i,j,nr=0;
	
	for (i=2;i<=n;i++)
	{
		if (prim[i]==0)
		{
			nr++;
			for (j=i+i;j<=n;j+=i)
				prim[j]=1;
		}
	}
	
	return nr;
}

int main()
{
	long n;

	FILE* f=fopen("ciur.in","rt");
	FILE* g=fopen("ciur.out","wt");

	fscanf(f,"%d", &n);
	fprintf(g,"%d\n",ciur(n));

	fclose(f);
	fclose(g);
	
	return 0;
}