打表即可
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+10;
typedef long long ll;
int n;
ll f[maxn];
int countFactorNumber(int n)
{
int s = 1;
for (int i = 2; i*i <= n; ++i)
{
if (n%i == 0)
{
int a = 0;
while (n%i == 0)
{
n /= i;
a++;
}
s *= a + 1;
}
}
if (n>1)
s *= 2;
return s;
}
void init(){
for(int i=1;i<=1e6;i++){
f[i]=f[i-1]+countFactorNumber(i);
}
}
int main(){
init();
scanf("%d",&n);
printf("%lld\n",f[n]);
}