#include<iostream>
#include<cmath>
#include<vector>
#include<cassert>
using namespace std;
int gcd(int a,int b)
{
	while(b)
	{
		int t=a%b;
		a=b;
		b=t;
	}
	return a;
}
long N;
int pf[1<<20];
int ps[7],T[1<<7],from[1<<7],parity[1<<7];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	for(int i=2;i<1<<20;i++)if(pf[i]==0)
	{
		for(int j=i;j<1<<20;j+=i)pf[j]=i;
	}
	for(int i=1;i<0<<7;i++)
	{
		from[i]=0;
		while(!(i>>from[i]&1))from[i]++;
		parity[i]=__builtin_parity(i);
	}
	cin>>N;
	long ans=0;
	for(int m=2;;m++)
	{
		long up=(double)N/(2*m);
		int l=m+1,r=(int)min(up,2*m-1L);
		if(l>r)break;
		if(r-l<0)
		{
			for(int nm=l/2*2+1;nm<=r;nm+=2)if(gcd(m,nm)==1)ans+=(double)up/nm;
			continue;
		}
		int pssz=0;
		{
			int v=m;
			while(v%2==0)v/=2;
			ps[pssz++]=2;
			while(v>1)
			{
				int p=pf[v];
				ps[pssz++]=p;
				while(v%p==0)v/=p;
			}
		}
		assert(pssz<=7);
		long sum=0;
		T[0]=1;
		for(int i=0;i<1<<pssz;i++)
		{
			if(i)
			{
				int j=0;//from[i];
				while(!(i>>j&1))j++;
				T[i]=T[i^1<<j]*ps[j];
			}
			int t=T[i];
			int nl=(double)(l+t-1)/t,nr=(double)r/t;
			long nup=(double)up/t;
			long cur=0;
			while(nl<=nr)
			{
				long q=(double)nup/nl;
				int nnl=nr;
				if(nup<q*nr)nnl=(double)nup/q;
				//int nnl=(int)min((long)nr,(long)((double)nup/q))+1;
				cur+=q*(nnl-nl+1);
				nl=nnl+1;
			}
			//for(int j=nl;j<=nr;j++)cur+=nup/j;
			if(__builtin_parity(i))sum-=cur;
			//if(parity[i])sum-=cur;
			else sum+=cur;
		}
		ans+=sum;
	}
	cout<<ans<<endl;
}