#include <cstdio>
#include <bitset>
using namespace std;
bool v[2000003];
int n,sol;
void solve()
{
    sol=1;
    for(int i=4;i<=n;i=i+2) v[i]=true;
    for(int i=3;i<=n;i=i+2)
    {
        if(v[i]==false)
        {
            ++sol;
            long long p=1ll*i;
            if(p*p>n) continue;
            for(int j=i*i;j<=n;j=j+2*i) v[j]=true;
        }
    }
}
int main()
{
    freopen("ciur.in","r",stdin);
    freopen("ciur.out","w",stdout);
    scanf("%d",&n);
    solve();
    printf("%d",sol);
    return 0;
}