#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 1e9 + 7;
template <class T>
inline void YES(T condition) {
  if (condition)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
template <class T>
inline void Yes(T condition) {
  if (condition)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
template <class T = string, class U = char>
int character_count(T text, U character) {
  int ans = 0;
  for (U i : text) {
    ans += (i == character);
  }
  return ans;
}
lint power(lint base, lint exponent, lint module) {
  if (exponent % 2) {
    return power(base, exponent - 1, module) * base % module;
  } else if (exponent) {
    lint root_ans = power(base, exponent / 2, module);
    return root_ans * root_ans % module;
  } else {
    return 1;
  }
}
struct position {
  int y, x;
};
position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}};
template <class T, class U>
string to_string(pair<T, U> x) {
  return to_string(x.first) + "," + to_string(x.second);
}
string to_string(string x) { return x; }
template <class itr>
void array_output(itr start, itr goal) {
  string ans;
  for (auto i = start; i != goal; i++) ans += to_string(*i) + " ";
  if (!ans.empty()) ans.pop_back();
  cout << ans << endl;
}
template <class itr>
void cins(itr first, itr last) {
  for (auto i = first; i != last; i++) {
    cin >> (*i);
  }
}
template <class T>
T gcd(T a, T b) {
  if (a && b) {
    return gcd(min(a, b), max(a, b) % min(a, b));
  } else {
    return a;
  }
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
struct combination {
  vector<lint> fact, inv;
  combination(int sz) : fact(sz + 1), inv(sz + 1) {
    fact[0] = 1;
    for (int i = 1; i <= sz; i++) {
      fact[i] = fact[i - 1] * i % mod;
    }
    inv[sz] = power(fact[sz], mod - 2, mod);
    for (int i = sz - 1; i >= 0; i--) {
      inv[i] = inv[i + 1] * (i + 1) % mod;
    }
  }
  lint C(int p, int q) const {
    if (q < 0 || p < q) return 0;
    return (fact[p] * inv[q] % mod * inv[p - q] % mod);
  }
};
template <class itr>
bool next_sequence(itr first, itr last, int max_bound) {
  itr now = last;
  while (now != first) {
    now--;
    (*now)++;
    if ((*now) == max_bound) {
      (*now) = 0;
    } else {
      return true;
    }
  }
  return false;
}
vector<lint> factorial, inv;
lint n;
vector<lint> prime, divisor_cnt, factor_cnt;
vector<vector<lint>> factor;
lint factor_cnt_max = 0;
lint dp[2000000];
lint choose(int now) {
  if (factor_cnt[now] == factor_cnt_max) {
    return 1;
  } else if (dp[now] != -1) {
    return dp[now];
  }
  lint ans = 0;
  for (int i = now * 2; i <= n; i += now) {
    if (prime[i / now] == 0) {
      continue;
    }
    ans += inv[n - n / i] * (n / now - n / i) % mod * choose(i) % mod;
  }
  return dp[now] = ans % mod;
}
int main() {
  cin >> n;
  prime.resize(n + 1, -1), divisor_cnt.resize(n + 1, -1),
      factor_cnt.resize(n + 1, 0), factor.resize(n + 1);
  prime[0] = prime[1] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= n; j += i) {
      divisor_cnt[j]++;
    }
    if (prime[i] != -1) {
      continue;
    }
    prime[i] = 1;
    factor[i].push_back(i);
    factor_cnt[i]++;
    for (int j = i * 2; j <= n; j += i) {
      prime[j] = 0;
      factor[j].push_back(i);
      int tmp_j = j;
      while (tmp_j % i == 0) {
        tmp_j /= i;
        factor_cnt[j]++;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    factor_cnt_max = max(factor_cnt_max, factor_cnt[i]);
  }
  factorial.resize(n + 100);
  inv.resize(n + 100);
  factorial[0] = 1;
  for (int i = 1; i < n + 100; i++) {
    factorial[i] = factorial[i - 1] * i % mod;
    inv[i] = power(i, mod - 2, mod);
  }
  memset(dp, -1, sizeof(dp));
  cout << factorial[n - 1] * choose(1) % mod << endl;
}
