#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;
ll mod=1e9+7;
vll DP(1e5+7,-1);

ll DF(ll M){
    if(DP[M]!=-1)return DP[M];
    ll res=0;
    for(ll i=1;i*i<=M;i++){
        if(M%i==0){
            res+=DF(M/i-1);
            res%=mod;
            if(M!=i*i){
                res+=DF(i-1);
            }
        }
    }    
    DP[M]=res;
    return res;
}
int main() {
    DP[0]=1;
    ll N;
    cin>>N;
    cout<<DF(N)<<endl;

}