#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

long long n;
bool v[2000010];

void sift(long long x)
{
    for (long long i=1LL*x*x; i<=n; i+=x)
        v[i]=true;
}

long long magic()
{
    long long s=0;
    for (long long i=2; i<=n; ++i)
    {
        if (!v[i])
            ++s;
        if (1LL*i*i<=n) sift(i);
    }
    return s;
}

int main()
{
    f>>n;
    t<<magic();
    return 0;
}