#include <bits/stdc++.h>
#pragma warning(disable : 4996); =
const long long int mod = 1e9 + 7;
using namespace std;
long long int n, k, fac[200007], rfac[200007], r[200007];
long long int C(long long int n, long long int k) {
  return (((fac[n] * rfac[k]) % mod) * rfac[n - k]) % mod;
}
void sol() {
  long long int i, j, s;
  r[1] = 1;
  rfac[0] = 1;
  rfac[1] = 1;
  fac[0] = 1;
  for (i = 1; i <= 200004; i++) {
    if (i != 1) r[i] = (mod * mod - (mod / i) * r[mod % i]) % mod;
    rfac[i] = (rfac[i - 1] * r[i]) % mod;
    fac[i] = (fac[i - 1] * i) % mod;
  }
  s = 0;
  s = C(2 * n - 1, n);
  s *= 2;
  s -= n;
  s %= mod;
  printf("%I64d\n", s);
}
int main() {
#pragma comment(linker, "/STACK:1073741824")
  while (scanf("%I64d", &n) != EOF) sol();
}
