#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_K = 200005;
ll cnt[MAX_K];

int main()
{
	ll K;
	cin >> K;
	for (int i = 1; i <= K; ++i)
	{
		for (int j = 1; j*j <= i; ++j)
		{
			if (i % j == 0)
			{
				cnt[i]++;
				if (i/j != j) cnt[i]++;
			}
		}
	}

	/*
	rep(i,K+1)
	{
		cout << cnt[i] << endl;
	}
	*/

	rep(i,K)
	{
		cnt[i+1] += cnt[i];
	}

	ll ans = 0;
	for (int i = 1; i <= K; ++i)
	{
		ans += cnt[K/i];
		//cout << cnt[K/i] << " ";
	}
	cout << ans << endl;
	return 0;
}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
#define rep(i,b,e) for(int i=b;i<e;i++)
#define per(i,e,b) for(int i=e;i>b;i--)
const int maxn = 5e5+5;

void solve() {
	int x;
	cin >> x;
	if (x >= 0) cout << x << '\n';
	else cout << "0\n";
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef DEBUG
	freopen("/home/l4wenwen/data/in", "r", stdin);
	//freopen("~/out", "w", stdout);
#endif
	//int t; cin >> t; while(t--)
		solve();
	return 0;
}