#include <fstream>
#include <vector>

using namespace std;

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

int cnt, n;

int low[2000005];
vector <int> primes;

int main() {
  cin >> n;
  low[2] = 2; primes.push_back(2);
  for(int i = 3; i <= n; i += 2) {
    if(low[i] == 0) {
      low[i] = i;
      primes.push_back(i);
    }
    for(int j = 0; j < primes.size() && primes[j] <= low[i] && 1LL * i * primes[j] <= n; j++)
      low[i * primes[j]] = primes[j];
  }
  cout << primes.size();
  return 0;
}