#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
void ciur(int v[], int n)
{
  int i = 2, j;
  while (i <= sqrt(n)) {
    if (v[i] != -1)
      for (j = i + i; j <= n; j += i)
        v[j] = -1;

    ++i;
  }
}

int main()
{
  int n, i, nr = 0;
  ifstream fin("ciur.in");
  fin >> n;
  int v[n] = {};

  ofstream fout("ciur.out");

  ciur(v, n);
  for (i = 2; i <= n; ++i)
    if (v[i] != -1)
      ++nr;

  fout << nr;
  return 0;
}