#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long N;
long long fac(long long x) {
  long long res = 1;
  for (int i = 1; i <= x; ++i) res = res * i % mod;
  return res;
}
long long qpow(long long x, long long y) {
  long long res = 1;
  for (; y; x = x * x % mod, y >>= 1)
    if (y & 1) res = res * x % mod;
  return res;
}
int main() {
  scanf("%lld", &N);
  long long fz = fac(2 * N - 1), fm = fac(N - 1) * fac(N) % mod;
  printf("%lld\n", (2 * fz % mod * qpow(fm, mod - 2) % mod - N + mod) % mod);
  return 0;
}
