#include <bits/stdc++.h>
using namespace std;
#define LL long long

vector<int> prime;
void find_prime(int n) {
    vector<int> lp(n, 0);
    for (int i = 2; i <= n; i++) {
        if (lp[i] == 0) { lp[i] = i; prime.push_back(i); }
        for (int j = 0; i * prime[j] <= n; j++) {
            lp[i * prime[j]] = prime[j];
            if (prime[j] == lp[i]) break; } } return;
}

LL n;
LL ans;
LL toprime[4000005];

LL cal(int p, LL sum) {
    sum = min(sum, (LL)4e6);
    if (toprime[sum] < p) return 0;
    return toprime[sum] - p + 1;
}

void f(LL sum, LL num, int pl) {
	ans += cal(pl, min(sum + 1, num));
	if (num < prime[pl] * prime[pl]) return;
	for (int i = pl; i < prime.size(); i++) {
		if (num < prime[i] * prime[i] || sum + 1 < prime[i]) break;
		LL tmp = prime[i];
		LL add = 1 + prime[i];
		while (tmp <= num) {
		    if (tmp != prime[i]) ans++;
			f(min((LL)1e7, sum * add), num / tmp, i + 1);
			tmp *= prime[i];
			add += tmp;
			add = min(add, (LL)1e7);
		}
	}
}

void solve() {
	cin >> n;
	ans = 1;
	f(1, n, 0);
	cout << ans << "\n";
	return;
}

int main() {
	ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
   	cout << fixed << setprecision(10);
	find_prime(3e6);
	int p = 0;
	for (int i = 2; i <= 4e6; i++) {
	    while (p < prime.size() && prime[p + 1] <= i) p++;
	    toprime[i] = p;
	}
	solve();
	return 0;
}