#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long n, nr;
bool prim[2000005];
int main()
{
    fin>>n;
    fin.close();
    int i,j;
    i=2;
    prim[1]=1;
    do
    {
        if ( prim[i] == 0)
            for (j = 2*i ; j <= n ; j = j + i)
                prim[j] = 1;
        i++;
    }
    while (i <= n);
    nr = 0;
    for (i = 2; i <= n; i++)
        if (prim[i] == 0)
            nr++;
    fout<<nr<<'\n';
    fout.close();
    return 0;
}