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

ifstream fin("ciur.in");
ofstream fout("ciur.out");
int p[2000000];

int main()
{
    long long n, contor=0;
    fin>>n;
    for (int i=2; i<=sqrt(n); i++)
    {
        if (p[i]==0)
        {
            contor++;
            for (int j=2*i; j<=n; j=j+i)
            {
                p[j]=1;
            }
        }
    }
    fout<<contor;
    return 0;
}