#include<bits/stdc++.h>
using std::cin;
using std::cout;
const int N = 3000005;
using ll = long long;
ll n;
ll sumd[N], maxsd[N], maxd[N];
bool is_pr[N];
ll pr[N], tot;
int min_id[N];
int bit[N];
inline void add(int x) {
	for(;x;x &= x - 1) bit[x] += 1;
}
inline int qry(int x) {
	int ans = 0;
	for(;x <= tot;x += x & -x) ans += bit[x];
	return ans;
}
inline void initpr(int p) {
	memset(is_pr, 0, sizeof(is_pr));
	p += 50;
	for(int i = 2;i <= p;++i) if(!is_pr[i]) {
		pr[++tot] = i;
		for(int j = i;j <= p;j += i) {
			is_pr[j] = 1;
			if(!min_id[j]) min_id[j] = tot;
		}
	}
}
ll ans;
struct qy { int a, b; };
const int Z = 3e7;
qy mem[Z]; int cnt;
inline int cmp(const qy & x, const qy & y) {
	return x.a < y.a;
}
inline void addq(int A, int B) {
	mem[++cnt] = {A, B};
}
inline void dfs(ll x, int i, ll sx) {
	ans += 1;
	if(x <= n / sx) {
		int R = std::upper_bound(pr + 1, pr + tot + 1, std::min(sx + 1, n / x)) - pr - 1;
		for(int j = i + 1;j <= R;++j) {
			ll p = pr[j];
			if(n / x / p < p) {
				ans += R - j + 1;
				break;
			}
			ll mul = p, su = p + 1;
			for(;x <= n / mul;su += mul *= p) {
				dfs(x * mul, j, sx * su);
			}
		}
	} else {
		if(n / x >= pr[i + 1])
			addq(n / x, i + 1);
	}
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n;
//	std::cerr << double(clock()) / CLOCKS_PER_SEC << '\n';
	const int m = sqrt(n) + 2;
	sumd[1] = 1;
	for(int i = 2;i <= m;++i) {
		if(!is_pr[i]) {
			ll su = 1;
			for(ll j = i;j <= m;j *= i) {
				su += j;
				for(int k = j;k <= m;k += j) {
					maxd[k] = i;
					is_pr[k] = 1;
					sumd[k] = su * sumd[k / j];
				}
			}
		}
		maxsd[i] = std::max(maxsd[i - 1], sumd[i]);
	}
	int lim = m;
	for(;maxsd[n / lim] + 1 >= lim;) {
		++ lim;
	}
	initpr(lim);
//	std::cerr << double(clock()) / CLOCKS_PER_SEC << '\n';
	dfs(1, 0, 1);
//	std::cerr << double(clock()) / CLOCKS_PER_SEC << '\n';
	std::sort(mem + 1, mem + cnt + 1, cmp);
//	std::cerr << double(clock()) / CLOCKS_PER_SEC << '\n';
	for(int i = 1, z = 2;i <= cnt;++i) {
		const qy & x = mem[i];
		for(;z <= x.a;++z) add(min_id[z]);
		ans += qry(x.b);
	}
//	std::cerr << double(clock()) / CLOCKS_PER_SEC << '\n';
	cout << ans << '\n';
}