#include <iostream>
#include <fstream>
#include <math.h>

using namespace std;

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

//Sieve of Eratosthenes:
//Documentation:  https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
//Problem:        https://infoarena.ro/problema/ciur
int main()
{
    //Intializations:
    int N; // the number greater than all primes.
    f >> N;
    int intPrimes[N+1];
    for(int i=0; i<=N; i++){
        intPrimes[i] = 1;
    }
    intPrimes[0] = 0; intPrimes[1] = 0;

    //Sieve filling:
    for(int i=2; i<=sqrt(N); i++){
        for(int j=i*i; j<=N; j=j+i){
            intPrimes[j] = 0;
            //if(intPrimes[j] == )
        }
    }

    //Compute number of primes.
    int numberOfPrimes = 0;
    for(int i=2; i<=N; i++){
        numberOfPrimes += intPrimes[i];
        //cout<<intPrimes[i]<<" ";
    }
    g << numberOfPrimes;
    return 0;
}