#include <bits/stdc++.h>

using namespace std;

int n, prime[2000000], cnt;

int main() {
    freopen("ciur.in", "r", stdin);
    freopen("ciur.out", "w", stdout);

    scanf("%d", &n);
    for (int i = 2; i <= n; ++i)
        prime[i] = 1;

    for (int i = 2; i <= n; ++i)
        if (prime[i]) {
            ++cnt;

            for (int j = i + i; j <= n; j += i)
                prime[j] = 0;
        }

    printf("%d\n", cnt);
    return 0;
}