#include <bits/stdc++.h>

using namespace std;

int n;

bitset <2000003> prim;

ifstream f("ciur.in");
ofstream g("ciur.out");

void Ciur()
{
    int i, j, s;

   prim[1] = 1;
   prim[2] = 1;

    for(i = 4; i <= n; i += 2)
    prim[i] = 1;

    for(i = 3; i*i <= n; i += 2)
        if (prim[i] == 0)
            for(j = i*i; j <= n; j += (2*i) )
                prim[j] = 1;

    s = 1;
    for (i = 3; i <= n; i += 2)
    if (prim[i] == 0) s++;
    g << s;



}

int main()
{
    f >> n;

    Ciur();
    return 0;
}