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

int n, primality_of_numbers[2000001];

void find_primality_of_numbers(int n) {
    for (int i = 2; i * i <= n; i++) {
        if (primality_of_numbers[i] == 0) {
            for (int j = 2; j * i <= n; j++) {
                primality_of_numbers[j * i] = 1;
            }
        }
    }
}

int number_of_prime_numbers(int n) {
    int counter = 0;
    for (int i = 2; i <= n; i++) {
        if (primality_of_numbers[i] == 0) {
            ++counter;
        }
    }
    return counter;
}

int main() {
    ifstream fin("ciur.in");
    ofstream fout("ciur.out");
    fin >> n;
    find_primality_of_numbers(n);
    fout << number_of_prime_numbers(n);
    return 0;
}