// ciurul lui Eratostene

#include <stdio.h>

int ciur(int n)
{
	long i,j;
	int nr=0, prim[200000];


	for (i=2;i<=n;i++)
	{
		if (prim[i])
		{
			nr++;
			for (j=i+i;j<=n;j+=i)
				prim[j]=0;
		}
	}
	
	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;
}