#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007

int main() {
	long long M; cin >> M;
	long long dp[M];
	for (int i = 0; i < M; i++) dp[i] = 0;
	vector<long long> v[M];
	for (int i = 0; i < M; i++) {
		dp[i] = 1;
		while (!v[i].empty()) {
			long long a = v[i].front();
			v[i].erase(v[i].begin());
			dp[i] += dp[(i + 1) / a - 2];
		}
		long long n = i + 1;
		while (n <= M) {
			v[n - 1].push_back(i + 1);
			n += i + 1;
		}
		dp[i] %= MOD;
	}
	cout << dp[M - 1] << endl;
}