#include <iostream>
using namespace std;

int main() {
	// your code goes here
	int n;
	cin >> n;
	int count=0;
	for(int i=1;i<n+1;i++){
		for(int j=1;j<n/i+1;j++){
			count=count+n/(i*j);
		}
	}
	cout << count;
	return 0;
}
#pragma GCC optimize("O3")

#include "bits/stdc++.h"

#define sz(x) (int)(x).size()
using namespace std;
const int mxN = int(2e5) + 5;
int64_t numFactors[mxN],pref[mxN];
int n;

void calculateNumFactors(int value) {
    for(int i=1; i*i<=value; i++) {
        if(value % i == 0)
            numFactors[value] += (i == value / i ? 1 : 2);
    }
}

int findLargest(int value) {
    int l = 1,r = n;
    int res = -1;
    while(l <= r) {
        int mid = l + (r - l) / 2;
        if(mid * 1LL * value <= n) {
            res = mid;
            l = mid + 1;
        }
        else
            r = mid - 1;
    }
    return res;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    for(int i=1; i<=n; i++)
        calculateNumFactors(i);
    for(int i=1; i<=n; i++)
        pref[i] = pref[i-1] + numFactors[i];
    int64_t res = 0;
    for(int first=1; first<=n; first++) {
        int value = findLargest(first);
        res += pref[value];
    }
    cout << res << "\n";

    return 0;
}
