#include<iostream>
using namespace std;
int main(){
  int n;
  long long cnt=0;
  cin>>n;
  for(int i=1;i<=n;i++){
    for(int j=1;j<=n/i;j++){
      for(int k=1;k<=n/i/j;k++){
	cnt++;
      }
    }
  }
  cout<<cnt<<endl;
  return(0);
}

#include<iostream>
#include<utility>
#include<algorithm>
#include<set>
#include<vector>
#include<cmath>
#define forn(i, x, n) for(int i = x; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const int mod = 998244353;
const bool DEBUG = 0;

vector<int> primes;
vector<int> lp(2e5+1);

void sieve(){
    forn(i, 2, lp.size()){
        if(lp[i] == 0){
            lp[i] = i;
            primes.push_back(i);
        }
        for(int j = 0; j < primes.size() && primes[j] <= i && primes[j]*i < lp.size(); j++){
            lp[primes[j]*i] = primes[j];
        }
    }

}


void solve(){
    int k;
    cin>>k;
    sieve();
    ll ans = 1;
    forn(i, 2, k+1){
        ll prod = 1;
        for(ll tmp = i, x = lp[tmp]; tmp > 1; x = lp[tmp]){
            ll p = 0;
            while(tmp%x == 0) tmp /= x, p++;
            if(DEBUG) cout<<i<<' '<<p<<'\n';
            prod  *= (p+2)*(p+1)/2;
        }
        if(DEBUG) cout<<prod<<'\n';
        ans += prod;
    }
    cout<<ans;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t = 1;
    //cin>>t;
	//while(t--) cout<<solve()<<'\n';
	while(t--) solve(), cout<<'\n';


}
