#include <iostream>
#include <fstream>
#include <cstdio>

using namespace std;
ofstream g("ciur.out");

int i, j, k, n;
bool prime[1000001];
int main()
{
    freopen("ciur.in", "r", stdin);
    scanf("%d", &n);
    k = 1;
    for(i=1; ((i * i) << 1) + (i << 1)<=n; i++)
        if(prime[i] == 0)
            for(j=((i*i) << 1) + (i << 1); (j << 1) + 1 <=n; j += (i << 1) + 1)
                prime[j] = 1;
    for(i=1; 2*i+1<=n; i++)
        if(prime[i] == 0)
            k++;
    g<<k;
    return 0;
}