#include <stdio.h>
using namespace std;

int n, rez=1, prim[2000010]; // prim[i]=0 -> i nr prim;

int main()
{
    freopen ("ciur.in","r",stdin);
    freopen ("ciur.out","w",stdout);
    scanf("%d", &n);
    for(int i=3;i<=n;i+=2)
        if(prim[i]==0)
        {
            rez++;
            for(int j=i+i;j<=n;j+=i)
                prim[j]=1;
        }
    printf("%d", rez);
    return 0;
}