#include <bits/stdc++.h>
using namespace std;
long long int n, m, mod = 1e9 + 7, d[100007], ob[100007], obfak[100007],
                    fak[100007];
void solve() {
  long long int i, j, v1, v2, k, ans = 0;
  obfak[0] = 1;
  obfak[1] = 1;
  ob[1] = 1;
  fak[1] = 1;
  fak[0] = 1;
  for (i = 2; i < 100007; i++) {
    ob[i] = (mod * mod - ((mod / i) * (ob[mod % i]))) % mod;
    fak[i] = (fak[i - 1] * i) % mod;
  }
  for (i = 2; i < 100007; i++) {
    obfak[i] = (obfak[i - 1] * ob[i]) % mod;
  }
  for (k = 1; k <= n; k++) {
    v1 = ((fak[n - 1] * obfak[k - 1]) % mod * obfak[n - k]) % mod;
    v2 = ((fak[n] * obfak[k]) % mod * obfak[n - k]) % mod;
    d[k] = ((v1 * v2) % mod) % mod;
    ans += d[k];
    if (k != 1) {
      ans += d[k];
    }
    ans %= mod;
  }
  printf("%I64d", ans % mod);
}
int main() {
#pragma comment(linker, "/STACK:268435456")
  while (scanf("%I64d", &n) != EOF) {
    solve();
  }
  return 0;
}
