#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 1000000007;

int main() {
    int M;
    cin >> M;
    vector<long long>dp(M+1);
    dp[M] = 1;
    for(int i = M; i >= 1; i--) {
        for(int j = 1; j*j <= i; j++) {
            if(i%j == 0) {
                dp[i/j-1] += dp[i];
                dp[i/j-1] %= mod;
                if(j*j != i) {
                    dp[i/(i/j)-1] += dp[i];
                    dp[i/(i/j)-1] %= mod;
                }
            }
        }
    }
    long long ans = 0;
    for(int i = 1; i <= M; i++) {
        ans += dp[i];
        ans %= mod;
    }
    cout << ans << endl;
}