#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;
	for (int i = 0; i < M; i++) {
		dp[i] = 1;
		for (int j = 1; j * j <= i + 1; j++) {
		    if ((i + 1) % j == 0) {
		        if (i + 1 == j) continue;
		        dp[i] += dp[(i + 1) / j - 2];
		        if (j * j != i + 1 && j != 1) dp[i] += dp[j - 2];
		    }
		}
		dp[i] %= MOD;
	}
	cout << dp[M - 1] << endl;
}