#include<fstream>
#include<cmath>

using namespace std;

ifstream f("ciur.in");
ofstream g("ciur.out");

int p[200002],n,nr;

void count();
int prim(int x);

int main()
{
	f>>n;
	count();
	g<<nr<<'\n';
	f.close();
	g.close();
	return 0;
}


void count()
{
	int i=-1,k;
	nr=n-1;
	for(i=0;i<n;p[++i]=i);
	for (i=2;i<=n;++i)
		for (k=i+i;k<=n;k+=i)
			if (k<=n&&p[k])
			{
				p[k]=0;
				--nr;
			}
}