#include <bits/stdc++.h>
#define NMAX (int)(2e6 + 5)

using namespace std;

int n, primesCount;
int ciur[NMAX];
/*int primes[NMAX];*/

int main()
{
    for (int div = 2; div * div <= NMAX; ++div)
        if (!ciur[div])
            for (int j = div * div; j <= NMAX; j += div)
                ciur[j] = 1;

    freopen("ciur.in", "r", stdin);
    freopen("ciur.out", "w", stdout);
    scanf("%d", &n);

    //transfer intr un vector numerele prime <= n
    /*primes[++primesCount] = 2;*/
    ++primesCount;
    for (int div = 3; div <= n; div += 2)
        if (!ciur[div])
            ++primesCount;
            /*primes[++primesCount] = div;*/

    printf("%d\n", primesCount);
    return 0;
}