#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define DEBUG(...)
#endif

template <class T, class Op = multiplies<T>>
constexpr T power(T a, long long n, Op op = Op(), T e = {1}) {
  assert(n >= 0);
  while (n) {
    if (n & 1) e = op(e, a);
    if (n >>= 1) a = op(a, a);
  }
  return e;
}

template <unsigned M> struct modular {
  using m = modular;
  static constexpr unsigned mod = M;
  unsigned v;
  modular(long long x = 0) : v((x %= mod) < 0 ? x + mod : x) {}
  m operator-() const { return m() -= *this; }
  m& operator+=(m b) { if ((int)(v += b.v - mod) < 0) v += mod; return *this; }
  m& operator-=(m b) { if ((int)(v -= b.v) < 0) v += mod; return *this; }
  m& operator*=(m b) { v = (uint64_t)v * b.v % mod; return *this; }
  m& operator/=(m b) { return *this *= power(b, mod - 2); }
  friend m operator+(m a, m b) { return a += b; }
  friend m operator-(m a, m b) { return a -= b; }
  friend m operator*(m a, m b) { return a *= b; }
  friend m operator/(m a, m b) { return a /= b; }
  friend bool operator==(m a, m b) { return a.v == b.v; }
};

using mint = modular<power(10, 9) + 7>;

vector<mint> fact, inv_fact, minv;
void prepare(int n) {
  fact.resize(n + 1), inv_fact.resize(n + 1), minv.resize(n + 1);
  for (int i = 0; i <= n; ++i) fact[i] = i ? fact[i - 1] * i : 1;
  inv_fact[n] = power(fact[n], mint::mod - 2);
  for (int i = n; i--; ) inv_fact[i] = (i + 1) * inv_fact[i + 1];
  for (int i = 1; i <= n; ++i) minv[i] = inv_fact[i] * fact[i - 1];
}
mint binom(int n, int k) {
  if (k < 0 or k > n) return 0;
  return fact[n] * inv_fact[k] * inv_fact[n - k];
}
template <> mint& mint::operator/=(mint b) {
  return *this *= b.v < minv.size() ? minv[b.v] : power(b, mod - 2);
}

template <class T> map<T, int> factorize(T n) {
  map<T, int> res;
  for (T i = 2; i * i <= n; ++i)
    while (n % i == 0) ++res[i], n /= i;
  if (n != 1) ++res[n];
  return res;
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  prepare(n);
  mint res;
  auto fn = [&](auto&& ep) {
    DEBUG(ep);
    int m = size(ep);
    vector<int> c(m);
    for (int i = 0; i < m; ++i) {
      c[i] = i and ep[i].first == ep[i - 1].first ? c[i - 1] : i;
      // c[i] = i and ep[i] == ep[i - 1] ? c[i - 1] : i;
    }
    vector<int> d(m);
    for (int i = m; i--; ) {
      d[i] = i < m - 1 and ep[i].first == ep[i + 1].first ? d[i + 1] : i;
      // d[i] = i < m - 1 and ep[i] == ep[i + 1] ? d[i + 1] : i;
    }
    mint cur = 1;
    int k = 0;
    for (int i = 0; i < m; ++i) {
      int e = ep[i].first;
      mint p = ep[i].second;
      cur *= power(p, d[i] + 1) - power(p, i);
      cur *= power(p, e * (m - d[i] - 1));
      cur *= power(p, (e - 1) * (m - c[i]));
      k += i == 0 or ep[i - 1].second != ep[i].second;
    }
    DEBUG(cur);
    res += power(n, 0) * fact[n] / cur;
  };
  auto mp = factorize(n);
  auto it = begin(mp);
  vector<pair<int, int>> v;
  set<vector<pair<int, int>>> se;
  auto dfs = [&](auto&& self) -> void {
    if (it == end(mp)) {
      auto sv = v;
      sort(begin(sv), end(sv));
      if (not se.count(sv)) {
        se.emplace(sv);
        fn(sv);
      }
      return;
    }
    for (int bt = 0; bt < 1 << (it->second - 1); ++bt) {
      vector<int> p{0};
      for (int i = 0; i < it->second - 1; ++i) {
        if (bt >> i & 1) {
          p.push_back(i + 1);
        }
      }
      p.push_back(it->second);
      int c = size(p) - 1;
      for (int i = 0; i < c; ++i) {
        v.emplace_back(p[i + 1] - p[i], it->first);
      }
      ++it;
      self(self);
      --it;
      v.erase(end(v) - c, end(v));
    }
  };
  dfs(dfs);
  // fn(vector<pair<int, int>>{{1, 2}, {1, 3}});
  // fn(vector<pair<int, int>>{{1, 3}, {1, 2}});
  cout << res.v << '\n';
}