#include <iostream>
#include <fstream>
#define NMAX 2000005
#define LL long long
#include <vector>
#include <bitset>
int c,n,i,j;
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset <NMAX> isprime;
vector <int> pr;
void ciur()
{
    for (int LL i=2;i<=NMAX;i++){
        if (isprime[i]==0){
            for (int LL j=i*i;j<=NMAX;j+=i){
                isprime[j]=1;

            }
            pr.push_back(i);
        }
    }
}
int main()
{
    fin >> n;
        ciur();
    for (i=0;pr[i]<=n;i++){
        c=c+1;
    }
    fout << c;
    return 0;
}