/*
Ciurul lui Eratostene.
Toate numerele prime <= n.

*/

/*
Rezolvare:


*/

#include <stdio.h>

FILE *in, *out;
int n;

int main ()
{
	char ciur[2000001];
	int t, i, j;

	in = fopen("ciur.in", "r");
	out = fopen("ciur.out", "w");

	fscanf(in, "%d", &n);
	
	for (i=2; i<=n; i++)
		ciur[i] = 0;

	t = 0;
	for (i=2; i<=n; i++)
	{
		if (ciur[i] == 0)
		{
			for (j=i*i; j<=n; j=j+i)
			{
				ciur[j] = 1;
			}
			t++;
		}
	}

	fprintf(out, "%d", t);


	fclose(out);
	fclose(in);

	return 0;
}