#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<atcoder/modint>
using mint = atcoder::modint1000000007;

#include<unordered_map>
#include<map>
const int M = 1<<17;
vector<map<int,mint>> memo(M+1);
vector<vector<int>> facs(M+1);

mint calc(int res,int can){
    if(res%can!=0) return 0;
    if(res==0) return 1;
    if(memo[res].find(can)!=memo[res].end()) return memo[res][can];
    mint tmp = 0;

    tmp += calc(res-can,can);
    for(auto&j:facs[res]) {
        if(j%can!=0) continue;
        if(j==can) continue;
        tmp += calc(res,j);
    }
    return memo[res][can] = tmp;
};

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int m;
    cin>>m;

    for(int i = 2;i<=m;i++){
        for(int j = i;j<=m;j+=i){
            facs[j].push_back(i);
        }
    }
    mint ans = 0;
    for(int i = 1;i<=m;i++) ans += calc(m,i);
    cout<<ans.val()<<endl;
}