#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long t = 1, n, m;
long long fact[N];
long long fastP(long long b, long long e) {
  if (!e) return 1;
  if (e & 1)
    return b * 1ll * fastP(b * 1ll * b % 1000000007, e >> 1) % 1000000007;
  return fastP(b * 1ll * b % 1000000007, e >> 1) % 1000000007;
}
long long mod_inverse(long long x) { return fastP(x, 1000000007 - 2); }
void fac() {
  fact[0] = 1;
  for (int i = 1; i < N; i++) {
    fact[i] = (1LL * i * fact[i - 1]) % 1000000007;
  }
}
long long nCr(long long n, long long r) {
  if (r > n) return 0;
  return (1LL * fact[n] % 1000000007 * mod_inverse(fact[n - r]) % 1000000007 *
          mod_inverse(fact[r]) % 1000000007) %
         1000000007;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  fac();
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans +=
        (nCr(n, i) % 1000000007 * nCr(n - 1, i - 1) % 1000000007) % 1000000007;
  }
  cout << (2 * ans - n) % 1000000007 << '\n';
}
