#include <fstream>
#include <bitset>

using namespace std;

ifstream cin("ciur.in");
ofstream cout("ciur.out");

int primes(int n){
  int count = 0;
  bitset<2000001> v;
  for(int i = 2; i <= n; i++){
    if(v[i] == false){
      count ++;
      for(int j = i; j <= n; j += i)
        v[j] = true;
    }
  }
  return count;
}

int main(){
  int n;
  cin >> n;
  cout << primes(n) << '\n';
}