#include<iostream>#include<cmath>#include<cstring>#include<cstdio>#include<algorithm>#define ll long longusingnamespacestd;
const ll maxn=1e3+5;
ll n,i,t,j,k,l,ans,d[maxn],f[maxn];
bool bz[maxn];
int main(){
freopen("uria.in","r",stdin);freopen("uria.out","w",stdout);
scanf("%lld",&n);
t=sqrt(n);
for (i=2;i<=t;i++){
if (!bz[i]) d[++d[0]]=i,f[i]=i-1;
for (j=1;j<=d[0];j++){
if (i*d[j]>t) break;
bz[i*d[j]]=true;
if (!(i%d[j])){
f[i*d[j]]=f[i]*d[j];break;
}
f[i*d[j]]=f[i]*(d[j]-1);
}
}
for (i=1;i<=t;i++)
k=n/(i*i),ans+=k*f[i];
printf("%lld\n",ans);
}