#include <bits/stdc++.h>
template <typename T>
void MACRO_VAR_Scan(T& t) {
  std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First& first, Rest&... rest) {
  std::cin >> first;
  MACRO_VAR_Scan(rest...);
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T& t) {
  std::cin >> t[p];
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {
  std::cin >> first[p];
  MACRO_VEC_ROW_Scan(p, rest...);
}
template <class T>
inline T CHMAX(T& a, const T b) {
  return a = (a < b) ? b : a;
}
template <class T>
inline T CHMIN(T& a, const T b) {
  return a = (a > b) ? b : a;
}
template <class T>
using V = std::vector<T>;
template <class T>
using VV = V<V<T>>;
template <typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<ll, ll>;
using PAIRLL = std::pair<ll, ll>;
constexpr ll INFINT = (1 << 30) - 1;
constexpr ll INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double EPS = 1e-10;
constexpr ll MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template <class T, size_t N>
void FILL(T (&a)[N], const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, size_t N, size_t M, class T>
void FILL(ARY (&a)[N][M], const T& val) {
  for (auto& b : a) FILL(b, val);
}
template <class T>
void FILL(std::vector<T>& a, const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, class T>
void FILL(std::vector<std::vector<ARY>>& a, const T& val) {
  for (auto& b : a) FILL(b, val);
}
class ModInt {
  friend std::istream& operator>>(std::istream& is, ModInt& obj);

 public:
  ll val;
  ModInt() : val(0) {}
  ModInt(ll n) : val(n % MOD) {
    if (val < 0) val += MOD;
  }
  ModInt& operator=(const ll& r) {
    val = r % MOD;
    if (r < 0) val += MOD;
    return *this;
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const {
    ModInt res;
    res.val = (val) ? MOD - val : 0;
    return res;
  }
  ModInt& operator+=(const ModInt& r) {
    if ((val += r.val) >= MOD) val -= MOD;
    return *this;
  }
  ModInt& operator+=(const ll& r) { return *this += ModInt(r); }
  ModInt& operator-=(const ModInt& r) { return *this += -r; }
  ModInt& operator-=(const ll& r) { return *this -= ModInt(r); }
  ModInt& operator++() { return *this += 1; }
  ModInt& operator++(signed tmp) { return *this += 1; }
  ModInt& operator--() { return *this += MOD - 1; }
  ModInt& operator--(signed tmp) { return *this += MOD - 1; }
  ModInt& operator*=(const ModInt& r) {
    (val *= r.val) %= MOD;
    return *this;
  }
  ModInt& operator*=(const ll& r) { return *this *= ModInt(r); }
  ModInt& operator^=(ll p) {
    ModInt res(1);
    while (p) {
      if (p & 1) res *= *this;
      *this *= *this;
      p >>= 1;
    }
    return *this = res;
  }
  ModInt& operator/=(const ModInt& r) { return *this *= r ^ (MOD - 2); }
  ModInt& operator/=(const ll& r) { return *this /= ModInt(r); }
  ModInt operator+(const ModInt& r) const {
    auto res(*this);
    return res += r;
  }
  ModInt operator-(const ModInt& r) const {
    auto res(*this);
    return res -= r;
  }
  ModInt operator*(const ModInt& r) const {
    auto res(*this);
    return res *= r;
  }
  ModInt operator/(const ModInt& r) const {
    auto res(*this);
    return res /= r;
  }
  ModInt operator+(const ll& r) const {
    auto res(*this);
    return res += r;
  }
  ModInt operator-(const ll& r) const {
    auto res(*this);
    return res -= r;
  }
  ModInt operator*(const ll& r) const {
    auto res(*this);
    return res *= r;
  }
  ModInt operator^(const ll& r) const {
    auto res(*this);
    return res ^= r;
  }
  ModInt operator/(const ll& r) const {
    auto res(*this);
    return res /= r;
  }
};
std::ostream& operator<<(std::ostream& os, const ModInt& obj) {
  os << obj.val;
  return os;
}
std::istream& operator>>(std::istream& is, ModInt& obj) {
  is >> obj.val;
  obj.val %= MOD;
  if (obj.val < 0) obj.val += MOD;
  return is;
}
std::vector<ll> enumerateMobius(ll n) {
  std::vector<ll> mu(n + 1, 0);
  mu[1] = 1;
  for (ll i = 1; i <= n; i++)
    if (mu[i])
      for (ll j = i << 1; j <= n; j += i) mu[j] -= mu[i];
  return mu;
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  ;
  ll m;
  MACRO_VAR_Scan(m);
  ;
  auto mu(enumerateMobius(m));
  ModInt ans = 1;
  for (ll i = (1); i < (m + 1); ++i) {
    if (mu[i] == 0) continue;
    ModInt rs = m / i;
    rs /= m;
    ans += -rs * mu[i] / (-rs + 1);
  }
  std::cout << (ans);
  std::cout << "\n";
  ;
  return 0;
}
