#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long mod = 1e9 + 7;
long long f[N], inv[N], ans, n;
long long fast(long long a, long long b) {
  if (b == 0) return 1;
  long long t = fast(a, b / 2);
  if (b % 2 == 0)
    return (t * t) % mod;
  else
    return ((t * t) % mod * a) % mod;
}
long long nCr(long long a, long long b) {
  return ((f[a] * inv[b]) % mod * inv[a - b]) % mod;
}
int main() {
  f[0] = 1;
  inv[0] = fast(f[0], mod - 2);
  for (long long i = 1; i < N; ++i) {
    f[i] = (f[i - 1] * i) % mod;
    inv[i] = fast(f[i], mod - 2);
  }
  scanf("%lld", &n);
  for (long long i = 1; i <= n; ++i) {
    ans = (ans + nCr(n, i) * nCr(n - 1, i - 1)) % mod;
  }
  ans *= 2;
  ans -= n;
  ans += mod;
  printf("%lld", ans % mod);
  return 0;
}
