#include <iostream>
//#include <algorithm>
#include <fstream>
using namespace std;

ifstream f("ciur2.in");
ofstream g("ciur2.out");
int n,v[2000003];
int euclid(int a, int b)
{
    if(b==0)
        return a;
    return euclid(b,a%b);
}
int main()
{
    f>>n;
    int i=2,nrprime=0;
    while(i<=n)
    {
        v[i]=1;
        nrprime++;
        int j=i*i;
        while(j<=n)
        {
            v[j]=-1;
            j+=i;
        }
        while(v[i]==1 or v[i]==-1)
            i++;
    }
    g<<nrprime;
    return 0;
}