#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int

struct Union{
  vector<ll> par;
  Union(ll a){
  par=vector<ll>(a,-1);
  }
  ll find(ll a){
    if(par[a]<0){
      return a;
    }
    else{
      return par[a]=find(par[a]);
    }
  }
  bool same(ll a,ll b){
    return (find(a)==find(b));
  }
  ll size(ll a){
    return -par[find(a)];
  }
  void unite(ll a,ll b){
    ll c=find(a),d=find(b);
    if(c==d)
      return;
    if(size(c)<size(d)){
      swap(c,d);
    }
    par[c]+=par[d];
    par[d]=c;
  }
};
ll euclidean_gcd(ll a, ll b) {
  if(a < b) return euclidean_gcd(b, a);
  ll r;
  while ((r=a%b)) {
    a = b;
    b = r;
  }
  return b;
}
ll euclidean_lcm(ll a, ll b) {
  return a/euclidean_gcd(a,b)*b;
}
int main(void){
  ll k,s=0;
  cin >> k;
  rep(i,k){
    rep(j,k){
      if((i+1)*(j+1)>k)break;
      s+=k/((i+1)*(j+1));
    }
  }
  cout << s << endl;
}
/***** In the name of Allah, the Most Gracious, the Most Merciful *****/
#include<bits/stdc++.h>
using namespace std;
#define Allahu_Akbar ios_base :: sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);

int main()
{
    Allahu_Akbar
	//freopen("input.txt", "r", stdin);
    int k;
    cin >> k;
    long long int total = 0;
    for(int i = 1; i<=k; i++)
    {
        for(int j = 1;  i * j<=k; j++)
        {
            for(int l = 1; i * j * l<=k; l++)
            {
                if((i * j * l) <= k) total++;
            }
        }
    }

    cout << total << endl;
    return 0;
}


