#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
using namespace std;
typedef pair<ll, ll> P;
using namespace atcoder;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
#define USE998244353
#ifdef USE998244353
const ll MOD = 998244353;
// const double PI = 3.141592653589;
using mint = modint998244353;
#else
const ll MOD = 1000000007;
using mint = modint1000000007;
#endif
const int MAX = 20000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll x, ll y) {
   if (y == 0) return x;
   else if (y > x) {
       return gcd (y, x); 
   }
   else return gcd(x % y, y);
}
ll lcm(ll x, ll y) {
   return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
    // 
    ll m = 0;
    ll M = 3000000001;
    while (M - m > 1) {
        ll now = (M + m) / 2;
        if (now * now <= x) {
            m = now;
        }
        else {
            M = now;
        }
    }
    return m;
}
ll keta(ll num, ll arity) {
    ll ret = 0;
    while (num) {
        num /= arity;
        ret++;
    }
    return ret;
}
ll ceil(ll n, ll m) {
    // n > 0, m > 0
    ll ret = n / m;
    if (n % m) ret++;
    return ret;
}
ll pow_ll(ll x, ll n) {
    if (n == 0) return 1;
    if (n % 2) {
        return pow_ll(x, n - 1) * x;
    }
    else {
        ll tmp = pow_ll(x, n / 2);
        return tmp * tmp;
    }
}
vector<ll> compress(vector<ll>& v) {
    // [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0] 
    vector<ll> u = v;
    sort(u.begin(), u.end());
    u.erase(unique(u.begin(),u.end()),u.end());
    map<ll, ll> mp;
    for (int i = 0; i < u.size(); i++) {
        mp[u[i]] = i;
    }
    for (int i = 0; i < v.size(); i++) {
        v[i] = mp[v[i]];
    }
    return v;
}

vector<ll> prime_fact(ll N) {
    ll n = N;
    vector<ll> ret;
    for (ll i = 2; i * i <= N; i++) {
        if (n % i == 0) {
            while (n % i == 0) {
                n /= i;
            }
            ret.push_back(i);
        }
    }
    if (n > 1) ret.push_back(n);
    return ret;
}

vector<ll> div(ll N) {
    vector<ll> ret;
    for (ll i = 1; i * i <= N; i++) {
        if (i * i == N) ret.push_back(i);
        else if (N % i == 0) {
            ret.push_back(i);
            ret.push_back(N / i);
        }
    }
    return ret;
}

int main() {
    // for (auto p : prime_fact(1000000000000)) {
    //     cout << p.first << ' ' << p.second << '\n';
    // }
    
    ll n;
    cin >> n;
    unordered_map<ll, mint> um; // um[i]... x_M = iとなる数
    auto ps = prime_fact(n);
    auto divs = div(n);
    sort(divs.begin(), divs.end());
    int sz = divs.size();
    um[1] = 1;
    for (int i = 0; i < sz; i++) {
        for (int j = i + 1; j < sz; j++) {
            ll m = divs[i];
            ll M = divs[j];
            if (M % m) continue;
            ll mt = m;
            ll Mt = M;
            ll tra = 1;
            for (auto p : ps) {
                ll cnt = 0;
                while (mt % p == 0) {
                    mt /= p;
                    Mt /= p;
                    cnt++;
                }
                if (Mt % p) {
                    // 素数pにおいて差がない
                    tra *= (cnt + 1);
                }
            }
            um[M] += um[m] * tra;
        }
    }
    cout << um[n].val() << endl;
    return 0;
}