#include <bits/stdc++.h>
using namespace std;
const int N = 1e7 + 10;
int log_2[N], pow2[35], not_prime[N];
vector<int> prime;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, cnt = 0;
    cin >> n;
    for (int i = 2; i <= n; ++i) {
        log_2[i] = log_2[i / 2] + 1;
        if (!not_prime[i]) {
            prime.push_back(i);
            int len = prime.size();
            for (int j = 0; j < len; ++j) {
                if (i * prime[j] > n)
                    break;
                not_prime[i * prime[j]] = 1;
                if (i % prime[j] == 0)
                    break;
            }
        }
    }
    pow2[0] = 1;
    for (int i = 1; i <= 30; ++i) {
        pow2[i] = pow2[i - 1] * 2;
    }
    int len = prime.size();
    for (int j = 0; j < len; ++j) {
        int i = prime[j];
        if (not_prime[i])
            break;
        int upper = n / pow2[log_2[i - 1] + 1], lower = 0;
        if (n % pow2[log_2[i - 1] + 1] < i) {
            ++lower;
        }
        cnt += upper / i - lower / i;
        if (lower % i == 0) {
            ++cnt;
        }
    }
    cout << cnt;
    return 0;
}