#include <iostream>
#include <bitset>
#include <cmath>
#include <fstream>
using namespace std;

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

const int MAX =   2000000 + 10;

bitset<MAX>p;

int nrP = 1;

int main()
{
    int i, j, n, r;
    fin>>n;
    p[1] = 1;
    r = sqrt(n) + 1;
    for(i=3; i<r; i+=2)
    {
        if(!p[i])
        {
            nrP++;
            for(j=i*i; j<=n; j+=(2*i))
            {
                p[j] = 1;
            }
        }
    }


    r+=(r%2 == 0);

    for(i=r; i<=n; i+=2)
    {
        if(!p[i])
        {
            nrP++;
        }
    }

    fout<<nrP;
    fin.close();
    fout.close();
    return 0;
}