//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const int thres=4e6;
int isp[thres+5];
int psum[thres+5];
ll pr[thres+5];
int tot;
ll n;
ll dfs(int cur,ll C,ll S)
{
	if(pr[cur]*pr[cur]>n/C) return 0;
	if(pr[cur]>S+1) return 0;
	ll val=1;
	ll ans=0;
	for(int i=0;;i++)
	{
		ans+=dfs(cur+1,C,min(S*val,n));
		if(i>=1&&min(S*val+1,n/C)>pr[cur])
			ans+=psum[min(S*val+1,n/C)]-psum[pr[cur]];
		if(i>=2)
			ans++;
		if(C*pr[cur]>n) break;
		C*=pr[cur];
		val=val*pr[cur]+1;
	}
	return ans;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	for(int i=2;i<=thres;i++)
		isp[i]=1;
	for(int i=2;i<=thres;i++)
		for(int j=i+i;j<=thres;j+=i)
			isp[j]=0;
	for(int i=2;i<=thres;i++)
		psum[i]=psum[i-1]+isp[i];
	for(int i=2;i<=thres;i++)
		if(isp[i])
			pr[++tot]=i;
	cin>>n;
	cout<<dfs(1,1,1)+1+(n>1)<<endl;
	return 0;
}