#include <iostream>
#include <string>
#include <sstream>
#include <iomanip> 
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <complex>

using namespace std;

//#pragma GCC optimize("Ofast")
//#pragma GCC optimization("unroll-loops, no-stack-protector")
//#pragma GCC target("avx,avx2,fma")

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);

	long long k, i, j, ans, x, s;
	cin >> k;
	vector<long long> v(k + 10, 0);		// # of ways to get AB <= x

	for (i = 1; i <= k; i++) {
		for (j = 1; (i * j) <= k; j++) v[i * j]++;
	}
	for (i = 1; i <= k; i++) v[i] += v[i - 1];

	ans = 0;
	for (i = 1; i <= k; i++) ans += v[k / i];
	cout << ans << "\n";

	return 0;
}


#include<bits/stdc++.h>
#define int long long
#define ll long long
#define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fs first
#define sd second
#define rept(x,n) for(int i=x;i<n;i++)
#define rrept(n,x) for(int i=n-1;i>=x;i--)
#define all(v) v.begin(),v.end()
#define mpit map<int,int>::iterator
#define stit set<int,int>::iterator
#define quit queue<int,int>::iterator
#define maxt(a,b,c) max(a,max(b,c))
#define mint(a,b,c) min(a,min(b,c))
#define rsort(v) sort(v.rbegin(),v.rend())
#define pb push_back
#define prnt(a,n) for(int i=0;i<n;i++)cout<<a[i]<<" ";
using namespace std;
void solve()
{
    ll m;
    cin>>m;
    ll cnt = 0;
     for(ll i = 1;;i++)
     {
         if(i>m)
            break;
         for(ll j = 1;;j++)
         {
             if(i*j>m)
                break;
             for(ll k = 1;;k++)
             {
                 if(i*j*k>m)
              {
                 break ;
              }
                 else
                    cnt++;

             }
         }
     }
    cout<<cnt<<"\n";

}
signed main()
{
    speed;
    int t=1;
    //cin>>t;
    while(t--)
    {
         solve();
    }
    return 0;
}