//kapi kapi spaghetti
#include <iostream>
#include <iomanip> //setprecision(12)
#include <algorithm>
#include <functional>
#include <map>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
 
typedef long long ll;
typedef unsigned long long ull;
 
using namespace std;

int main()
{
    ll K;
    cin>>K;
    
    vector<ll> sum(K+1,0);
    for(ll i=1; i<=K; i++)
    {
        ll cnt=0;
        for(ll k=1; k*k<=i; k++)
        {
            if(i%k==0) cnt+=2;
            if(k*k==i) cnt--;
        }
        sum[i]=sum[i-1]+cnt;
    }
    
    ll res=0;
    for(ll c=1; c<=K; c++)
    {
        res+=sum[K/c];
    }
    
    cout<<res<<endl;
    return 0;
}

#include <iostream>

using namespace std;

int main() {

    int K;
    cin >> K;

    int a = 1, b = 1, c = 1, cnt = 0;

    while(true) {
        if(a * b * c <= K) {
            c++;
            cnt++;
        } else if(a * b <= K) {
            c = 1;
            b++;
        } else if(a <= K) {
            b = c = 1;
            a++;
        } else {
            break;
        }
    }

    cout << cnt << endl;

    return 0;
}