#include <bits/stdc++.h>
const double Pi = 3.14159265;
const int N = 2e5 + 10;
const unsigned long long base = 163;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-10;
const double pi = acos(-1);
using namespace std;
long long inv[N];
long long dp[N];
int main() {
  long long p = mod;
  long long n;
  cin >> n;
  inv[1] = 1;
  for (int i = 2; i <= n; i++) inv[i] = (p - p / i) * inv[p % i] % p;
  long long ans = 1;
  for (int i = n; i >= 2; --i) {
    dp[i] = n / i * inv[n - n / i];
    for (int j = i + i; j <= n; j += i) {
      dp[i] -= dp[j];
      dp[i] %= mod;
    }
    dp[i] += mod;
    dp[i] %= mod;
    ans += dp[i];
    ans %= mod;
  }
  cout << ans;
  return 0;
}
