#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;

typedef unsigned long ulong;
typedef unsigned int uint;

namespace Prime {

	bool Check(ulong prime) {
		for(int i = 2; i*i <= prime; i++) {
			if(prime%i == 0)
				return false;
		}
		
		return true;
	}
}

int main()
{
	const char * inFile = "ciur.in";
	const char * outFile = "ciur.out";

	ifstream fin(inFile);
	ofstream fout(outFile);
	
	uint totalPrimes = 0;
	ulong n;

	fin >> n;
	
	bool isPrime[n+1];
	totalPrimes = n - 1; //	(1 is not prime)
    
	for(uint i = 1; i < n+1; i++) {
		isPrime[i] = true;
	}
    
	ulong i, j;
	for (i = 2; i*i <= n; i++) {
		if (isPrime[i]) {
			j = 2;
			while (i*j <= n) {
				ulong multiple = i*j;
				if(isPrime[multiple]) 
					totalPrimes--;
				isPrime[multiple] = 0;
				j++;				  
            }
        }
    }
	
	fout << totalPrimes << endl;
	
	fout.close();
	fin.close();
	
	return 0;
}