#include <bits/stdc++.h>

using namespace std;

ifstream fin ("ciur.in");
ofstream fout("ciur.out");

const int maxs = 2e6 + 1;
int v[maxs];
bool ciur[maxs];

void ciuru()
{
    ciur[0] = 1;
    ciur[1] = 1;
    for (int i = 2; i <= maxs; i++){
        if (ciur[i] == 0){
            for (int k = 2 * i; i <= maxs; k += i){
                ciur[k] = 1;
            }
        }
    }
}

int main ()
{
    ciuru();
    int n, i = 2, cnt = 0;
    fin >> n;
    while (i < n){
        if (ciur[i] == 0){
            cnt ++;
        }
    }
    fout << cnt;
}