#include <cstdio>

using namespace std;

int n;
bool prim[2000010];

int ciur ()
{
    int nr = 0;

    for (int i = 2; i <= n; i++)
        if (!prim[i])
        {
            nr++;

            for (int j = i * i; j <= n; j += i)
                if (j > 0) prim[j] = true;
                else break;
        }

    return nr;
}

int main ()
{
    freopen ("ciur.in", "r", stdin);
    freopen ("ciur.out", "w", stdout);

    scanf ("%d", &n);
    printf ("%d\n", ciur ());

    return 0;
}