#include <iostream>
using namespace std;
typedef long long ll;

const ll MOD = 1000000007;

ll dp[100005];
bool b[100005];

ll rec(ll m){
    if(m == 0) return 1;
    if(b[m]) return dp[m];
    b[m] = true;
    for(int i = 1; i * i <= m; i++){
        if(m % i == 0){
            dp[m] = (dp[m] + rec(m / i - 1)) % MOD;
            if(m / i > i) dp[m] = (dp[m] + rec(i - 1)) % MOD;
        }
    }
    return dp[m];
}

int main()
{
    int m;
    cin >> m;
    cout << rec(m) << endl;
}