///Determinarea tuturor numerelor prime mai mici sau egale cu un "n" dat;

#include <iostream>
#include <cstdio>
#include <bitset>

using namespace std;


bitset <3000000> a;
long long n, nq;


int main()
{
    freopen("ciur.in", "r", stdin);
    freopen("ciur.out", "w", stdout);
    cin >> n;
    nq++;
    //prim[nq++] = 2;
    for(long long i=3; i<=n; i+=2){
        if(a[i] == 0)
            nq++;//  prim[nq++] = i;
        for(long long j=i*i; j<=n; j+=2*i)
            a[j] = 1;
    }
    cout << nq << endl;
  //  for(int i=0; i<nq; i++)
    //    if(i!=0) cout << " " << prim[i];
      //  else     cout <<prim[i];
    return 0;
}