#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
using Graph = vector<vector<int>>;

const ll mod = 1000000007;

map<Pr,ll> memo;
ll search(ll m,ll sum,vector<vector<ll>> &div){
    if(sum<0) return 0;
    if(sum==0) return 1;
    Pr p = make_pair(m,sum);
    if(memo.count(p)) return memo[p];
    ll cnt = 0;
    for(ll x:div[m]){
        cnt += search(x,sum-x,div);
    }
    memo[p] = cnt;
    //cout << m << " " << sum << " " << cnt << endl;
    return cnt;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll M; cin >> M;
    vector<vector<ll>> div(M+1);
    for(ll i=1;i<=M;i++){
        for(ll j=i;j<=M;j+=i){
            div[j].push_back(i);
        }
    }
    ll ans = 0;
    for(ll i=1;i<=M;i++){
        ans += search(i,M-i,div);
    }
    cout << ans << endl;
}