#include <fstream>
#include <cstdlib>
#define N_MAX (2000000>>4)+1

using namespace std;
char isPrime[N_MAX];
int main( void )
{
	int N, i, j, toAdd, count;
	ifstream in( "ciur.in" );
	in>>N;
	for( i=1; ((i*i)<<1)+(i<<1) < N; ++i )
		if( 0 == ( isPrime[i>>3] & (1<<(i&7)) ) )
		{
			toAdd=(i<<1)+1;
			for( j=((i*i)<<1)+(i<<1); (j<<1) < N; j+=toAdd )
				isPrime[j>>3]|=1<<(j&7);
		}
	for( count=1, i=3, j=1; i <= N; i+=2, ++j )
		if( 0 == ( isPrime[j>>3] & (1<<(j&7)) ) )
			++count;
	ofstream out( "ciur.out" );
	out<<count<<'\n';
	return EXIT_SUCCESS;
}