#include <bits/stdc++.h>
using namespace std;
long long modulo(long long base, long long exponent, long long modulus);
long long choose(long long n, long long k);
long long inverse(long long a, long long m);
void build();
long long ncr(long long n, long long r);
long long dp[100010];
vector<long long> fact[100010];
void seive() {
  for (int i = 1; i < 100010; i++) {
    long long p = i;
    while (p < 100010) {
      fact[p].push_back(i);
      p += i;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  seive();
  long long n;
  cin >> n;
  dp[1] = 1;
  for (long long i = 2; i <= n; i++) {
    vector<long long> temp(fact[i].size(), 0);
    temp[fact[i].size() - 1] = n / i;
    for (long long j = fact[i].size() - 2; j >= 0; j--) {
      long long x = fact[i][j];
      temp[j] = n / x;
      for (long long k = fact[i].size() - 1; k > j; k--) {
        if (fact[i][k] % x == 0) temp[j] -= temp[k];
      }
      dp[i] +=
          (((inverse(n, 1000000007) * temp[j]) % 1000000007) * (dp[x] + 1)) %
          1000000007;
      dp[i] %= 1000000007;
    }
    dp[i] += (temp[fact[i].size() - 1] * inverse(n, 1000000007));
    dp[i] %= 1000000007;
    long long foo =
        (1 - (inverse(n, 1000000007) * temp[fact[i].size() - 1]) % 1000000007 +
         1000000007) %
        1000000007;
    dp[i] *= inverse(foo, 1000000007);
    dp[i] %= 1000000007;
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += dp[i];
    ans %= 1000000007;
  }
  ans *= inverse(n, 1000000007);
  ans %= 1000000007;
  cout << ans << endl;
  return 0;
}
long long ncr(long long n, long long r) {
  if (r > n || r < 0 || n < 0) return 0;
  return 1;
}
void build() {}
long long modulo(long long base, long long exponent, long long modulus) {
  if (modulus == 1) return 0;
  long long result = 1;
  base = base % modulus;
  while (exponent > 0) {
    if (exponent % 2 == 1) {
      result = (result * base) % modulus;
    }
    exponent = exponent >> 1;
    base = (base * base) % modulus;
  }
  return result;
}
long long choose(long long n, long long k) {
  if (k == 0) return 1;
  return (n * choose(n - 1, k - 1)) / k;
}
void EE(long long a, long long b, long long &co1, long long &co2) {
  if (a % b == 0) {
    co1 = 0;
    co2 = 1;
    return;
  }
  EE(b, a % b, co1, co2);
  long long temp = co1;
  co1 = co2;
  co2 = temp - co2 * (a / b);
}
long long inverse(long long a, long long m) {
  long long x, y;
  EE(a, m, x, y);
  if (x < 0) x += m;
  return x;
}
