#include <bits/stdc++.h>
using namespace std;

int main() {
	int k; cin >> k;
	int res = 0;
	for (int i=1; i<=k; i++)
		for (int j=1; j<=k/i; j++)
			for (int l=1; l<=k/i/j; l++)
				res++;
	cout << res << '\n';
	return 0;
}

#include<bits/stdc++.h>
#define rep(i,k,n) for(int i = k; i < n; i++)
using ll = long long;
using namespace std;

// arc113a
// 列挙
// 重複あり並べ方パターン


int main(){
    ll K_0;
    cin >> K_0;

    int res = 0;
    rep(i,1,K_0 + 1){
        ll K = i;
    for(ll A = 1; A*A*A <= K; A++){
        if(K%A == 0){
            ll K_1 = K/A;
            for(ll B = A; B*B <= K_1; B++){
                if(K_1%B == 0){
                    ll C = K_1/B;
                    if(A < B && B < C) res += 6;
                    else if((A == B && B < C) || (A < B && B == C))
                        res += 3;
                    else res += 1;
                    // cout << "(A, B, C):\n\t";
                    // cout << "(" << A << ", " << B << ", " << C << ")" << endl;
                    // cout << "res:\n\t";
                    // cout << res << endl;
                }
            }
        }
    }
    }
    cout << res << endl;
    return 0;
}