#include<bits/stdc++.h>

#define ll long long int

using namespace std;

int seiv[200007];
ll res[200007];

int main () {
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    memset(seiv, 0, sizeof(seiv));
    memset(res, 0, sizeof(res));
    res[1] = 1;
    int k;
    cin >> k;
    if (k == 1) {
        cout << 1 << endl;
        return 0;
    }
    for (int i=2; i<=k; i++) {
        if (!seiv[i]) {
            res[i] = res[i-1] + 3;
            for (int j=2; j*i <= k; j++) {
                seiv[j*i] = 1;
                int cnt = 1, tmp = j;
                while (tmp%i == 0) {
                    cnt++;
                    tmp /= i;
                }
                if (!res[i*j]) res[i*j] = (cnt + 2)*(cnt + 1)/2;
                else res[i*j] *= (cnt + 2)*(cnt + 1)/2;
            }
        }
        else {
            res[i] += res[i-1];
        }
    }
    cout << res[k] << endl;

    return 0;
}
#include "bits/stdc++.h"

using namespace std;
using LL = long long;

constexpr int N = 1e5 + 5;

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	int n;
	cin >> n;

	LL res = 0;
	for (int i = 1; i * i * i <= n; i++) {
		for (int j = i; i * j * j <= n; j++) {
			int k = n / (i * j);
			if (i == j) {
				res += (k - j) * 3 + 1;
			}
			else {
				res += (k - j) * 6 + 3;
			}
		}
	}

	cout << res << endl;
}