#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5, mod = 1e9 + 7;
long long n, f[N], g[N];
long long mul(long long x, long long n, long long mod) {
  long long ans = mod != 1;
  for (x %= mod; n; n >>= 1, x = x * x % mod)
    if (n & 1) ans = ans * x % mod;
  return ans;
}
void init(long long n) {
  f[0] = g[0] = 1;
  for (long long i = 1; i <= n; i++) f[i] = f[i - 1] * i % mod;
  g[n] = mul(f[n], mod - 2, mod);
  for (long long i = n - 1; i; i--) g[i] = g[i + 1] * (i + 1) % mod;
}
long long C(long long n, long long m) {
  if (n < m) return 0;
  return f[n] * g[m] % mod * g[n - m] % mod;
}
signed main() {
  scanf("%lld", &n), init(2 * n);
  printf("%lld\n", (2 * C(2 * n - 1, n) % mod - n) % mod);
  return 0;
}
