#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
const int inv2 = 5e8 + 4;

int64_t mod_pow(int64_t x, int64_t n, int64_t mod) {
  int64_t ret = 1;
  while(n > 0) {
    if(n & 1) (ret *= x) %= mod;
    (x *= x) %= mod;
    n >>= 1;
  }
  return ret;
}

int main() {
  int N;
  cin >> N;
  int64 ret1 = 1;
  for(int i = 1; i <= 2 * N; i++) (ret1 *= i) %= mod;
  int64 ret2 = 1;
  for(int i = 1; i <= N; i++) (ret2 *= 2) %= mod;
  ret1 *= mod_pow(ret2, mod - 2, mod);
  ret1 %= mod;
  for(int i = 1; i <= N; i++) (ret1 *= i) %= mod;
  cout << ret1 << endl;
}