#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 20000001;
bool mark[NMAX];
int prime[NMAX],k;

void ciur()
{
	for (int i = 2; i*i <= NMAX; i++)
	{
		if (!mark[i])
		{
			for (int j = i*i; j <= NMAX; j += i)
				mark[j] = true;
		}
	}
	for (int i = 2; i <= NMAX; i++)
		if (!mark[i])
			prime[++k] = i;
}

int main()
{
	ciur();
	int n;
	in >> n;
	in.close();
	int poz = 1, nr = 0;
	while (prime[poz] <= n)
	{
		nr++;
		poz++;
	}
	out << nr << "\n";
	out.close();
	return 0;
}