#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30);
const long long mod = 1000000007;
long long n;
long long fac[2000010];
void init() {
  fac[1] = 1;
  for (long long i = 2; i < 2000010; i++) {
    fac[i] = (fac[i - 1] * i) % mod;
  }
}
long long power(long long a, long long b, long long MOD) {
  long long res = 1;
  a %= MOD;
  while (b) {
    if (b & 1) {
      res = res * a % MOD;
      b--;
    }
    b >>= 1;
    a = a * a % MOD;
  }
  return res;
}
long long C(long long n, long long m) {
  if (m > n) return 0LL;
  long long tmp;
  tmp = (fac[n] * power(fac[m], mod - 2, mod) % mod) *
        power(fac[n - m], mod - 2, mod) % mod;
  return tmp;
}
int main() {
  init();
  scanf("%I64d", &n);
  printf("%I64d\n", (2LL * C(2 * n + 1, n) - 1LL + mod) % mod);
  return 0;
}
