#include <bits/stdc++.h>
using namespace std;
const long long N = 200050, p = 1000000007;
long long n, f[N];
long long pow(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y & 1) res = res * x % p;
    x = x * x % p;
    y >>= 1;
  }
  return res;
}
signed main() {
  scanf("%lld", &n);
  f[0] = 1;
  for (long long i = 1; i <= n * 2 - 1; i++) f[i] = f[i - 1] * i % p;
  long long t =
      ((2 * (f[n * 2 - 1] * pow(f[n], p - 2) % p * pow(f[n - 1], p - 2)) % p -
        n) %
           p +
       p) %
      p;
  printf("%lld\n", t);
}
