#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;
    fin>>n;
    p[1] = 1;
    for(i=2; i*i<=n; i++)
    {
        if(!p[i])
        {
            for(j=i*i; j<=n; j+=i)
            {
                p[j] = 1;
            }
        }
    }


    fout<<n - p.count();
    fin.close();
    fout.close();
    return 0;
}