#include <iostream>
#include <deque>
#include <vector>
#include <cstring>
#include <bitset>
#include <algorithm>
using namespace std;

int N, i, j, sol;
bitset<2000010> compus;

int main()
{
    freopen("ciur.in","r",stdin);
    freopen("ciur.out","w",stdout);
    scanf("%d", &N);
    sol = 1;
    for(i = 3; i <= N; i+=2)
    {
        if(compus[i] == 0)
        {
            sol = sol  + 1;
            if(i > 2000)continue;
            for(j = i * i ; j <= N; j+=i)
                compus[j] = 1;
        }
    }
    cout<<sol<<"\n";
    return 0;
}