#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include <bits/stdc++.h>
using namespace std;

int cnt,pri[10000010],vis[10000010],sum[10000010];
long long n,ans=1ll;

inline void init()
{
	for(int i=2;i<=10000000;i++){
		if(!vis[i]) pri[++cnt]=i;
		for(int j=1;j<=cnt&&i*pri[j]<=10000000;j++){
			vis[i*pri[j]]=1;
			if(i%pri[j]==0) break;
		}
	}
	sum[1]=0;
	for(int i=2;i<=10000000;i++) sum[i]=sum[i-1]+(!vis[i]);
}

inline void dfs(int lvl,long long S,long long V,bool flag)
{
	if(pri[lvl]>S+1) return;
	if(V*pri[lvl]>n) return;
	if(flag) ans+=1ll*(sum[min(S+1,n/V)]-sum[pri[lvl]-1]);
	if(V*pri[lvl]*pri[lvl]<=n){
		long long now1=1,now2=1;
		for(int i=0;V*now2<=n;i++){
			if(i>=2) ans++;
			dfs(lvl+1,S*now1,V*now2,(i>0));
			now2=now2*pri[lvl];now1+=now2;
		}
	}
}

signed main()
{
	ios::sync_with_stdio(false);cin.tie(0);
	init();
	cin>>n;
	dfs(1,1,1,1);
	cout<<ans<<'\n';
	return 0;
}