#include <stdio.h>

char p[(20000000 << 3) + 10];

unsigned sieve(unsigned n)
{
    //char p[(n << 3) + 1];

     unsigned i, j, k, nr = 1 + (n > 2);

    for(i = 5; i * i <= n - 2; i += 6)
    {
        if((p[i >> 3] & (1 << (i & 7))) == 0)
        {
            for(j = i * i; j <= n; j += i << 1)
            {
                p[j >> 3] |= (1 << (j & 7));
            }
        }

        k = i + 2;

        if((p[k >> 3] & (1 << (k & 7))) == 0)
        {
            for(j = k * k; j <= n; j += k << 1)
            {
                p[j >> 3] |= (1 << (j & 7));
            }
        }
    }

    for(i = 5; i <= n - 2; i += 6)
    {
        nr += ((p[ i      >> 3] & (1 << ( i      & 7))) == 0) +
              ((p[(i + 2) >> 3] & (1 << ((i + 2) & 7))) == 0);
    }

    return nr;
}

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

    unsigned N; scanf("%d", &N);

    printf("%u ", sieve(N));

    return 0;
}