#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long mod = 1000000007;
long long dp[100010] = {};
int main() {
	long long m;
	cin >> m;
	for (int i = 1; i <= m; i++) {
		dp[i] = 1;
	}
	for (int i = 2; i <= m; i++) {
		for (int j = 1; j * j <= i; j++) {
			if (i % j == 0) {
				dp[i] += dp[j - 1];
				if (j - 1 != i / j - 1) {
					dp[i] += dp[i / j - 1];
				}
				dp[i] %= mod;
			}
		}
	}
	cout << dp[m] << endl;
}