#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int MAX=1000000;
bitset<MAX> isprime;
void sieve(){
	for(int i=3; i<MAX; i++, i++) isprime[i]=1;
	isprime[2]=1;
	for(int i=3; i<MAX; i++){
		if(isprime[i]){
			for(int j=(i<<1); j<MAX; j+=i) isprime[j]=0;
		}
	}
}
ll p[MAX], n, sq;
int isq;
vector<ll> divs, pc;
inline ll idx(ll x){
	return (x<=sq)?x-1:(ll)divs.size()-n/x;
}
void calc(){
	sieve();
	while((sq+1)*(sq+1)<=n) sq++;
	for(int i=1; i<=sq; i++) divs.push_back(i);
	for(int i=sq; i>=1; i--) if(n/i>sq) divs.push_back(n/i);
	int k=0; isq=-1;
	for(int i=2; i<MAX; i++){
		if(isprime[i]){
            p[k]=i;
            if(i>sq && isq==-1) isq=k;
            k++;
		}
	}
}
void primecount(){
	vector<ll> dp=divs;
	pc.resize(divs.size(), -1);
	int l;
	for(l=0; l<divs.size() && divs[l]<p[0]*p[0]; l++){
		if(divs[l]<=1) pc[l]=0;
		else if(divs[l]==2) pc[l]=1;
		else pc[l]=2;
	}
	for(int i=1; i<=isq; i++){
		int r=lower_bound(divs.begin(), divs.end(), p[i]*p[i])-divs.begin();
		for(int j=(int)divs.size()-1; j>=l; j--){
			int k=idx(divs[j]/p[i-1]);
			if(pc[k]!=-1) dp[j]-=pc[k]-i+2;
			else dp[j]-=dp[k];
		}
		for(int j=l; j<r; j++) pc[j]=dp[j]+i-1;
		l=r;
	}
}
bool is_prime(ll x){
    if(x<MAX) return isprime[x];
    for(ll i=2; i*i<=x; i++) if(x%i==0) return false;
    return true;
}
vector<ll> prime;
ll ans;
void dfs(int k, ll x, ll phi){
    for(int i=k; i<prime.size(); i++){
        if(phi*(prime[i]-1)>n/prime[i]) break;
        ll y=x*prime[i], phiy=phi*(prime[i]-1);
        ans+=pc[idx(n/phiy)]-(i+1);
        dfs(i+1, y, phiy);
        while(phiy<=n/prime[i]){
            y*=prime[i], phiy*=prime[i];
            ans+=1+max(0ll, pc[idx(n/phiy)]-(i+1));
            dfs(i+1, y, phiy);
        }
    }
}
int main()
{
	cin>>n;
	calc(); primecount();
    for(int i=2; i<MAX; i++) if(isprime[i]) prime.push_back(i);
    for(int i=0; i<divs.size(); i++) if(is_prime(divs[i]+1)) pc[i]++;
    dfs(0, 1, 1);
	cout<<ans+pc.back()+1<<endl;
	return 0;
}