#include<bits/stdc++.h>

using namespace std;

typedef long long int64;
const int64 mod = 1e9 + 7;

inline int64 modPow(int64 x, int64 n)
{
  if(n == 0) return (1);
  int64 ret = modPow(x, n / 2);
  (ret *= ret) %= mod;
  if(n & 1) (ret *= x) %= mod;
  return (ret);
}

inline int64 modInv(int64 a)
{
  return (modPow(a, mod - 2));
}

int main()
{
  int N;
  cin >> N;

  int64 fact = 1, malta = 1;
  for(int i = 1; i <= 2 * N; i++) (fact *= i) %= mod;
  for(int i = 1; i <= N; i++) (malta *= 2) %= mod;
  cout << fact * modInv(malta) % mod << endl;
}