#include <fstream>
#include <cmath>

using namespace std;

const int MAXN = 2000003;

bool prim[MAXN];

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

    int n;
    in >> n;

    for (int i = 2; i <= sqrt(n); i++)
        for (int j = i; j <= n/i; j++)
            prim[i * j] = 1;

    int sol = 0;
    for (int i = 2; i <= n; i++)
        if (!prim[i])
            ++sol;
    out << sol << '\n';

    return 0;
}