#include <fstream>
#include <bitset>

using namespace std;

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

int n,k,i,j;
bitset <2000001> prim;

void eratostene()
{
    prim[1] = 1;
    for(i = 4; i <= n; i += 2)
        prim[i] = 1;
    for(i = 3; i * i <= n; i += 2)
    {
        j = 3;
        while(i * j <= n)
        {
            prim[i * j] = 1;
            j += 2;
        }
    }
}

int main()
{
    f >> n;
    eratostene();
    for(i = 1; i <= n; ++ i)
        if(!prim[i])
        ++ k;
    g << k;
}