#include <iostream>
#include <fstream>

using namespace std;
int notPrime[2000005];

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

    int n, c = 0;
    fin >> n;
    notPrime[0] = notPrime[1] = true;
    for (int i = 2; i <= n; ++i) {
        for (int j = i + i; j <= n; j += i) {
            notPrime[j] = true;
        }
    }
    for (int i = 0; i <= n; ++i) {
        if (!notPrime[i]) {
            c += 1;
        }
    }
    fout << c;
    return 0;
}