#include <iostream>
#define ZERO 0
using namespace std;
//错误1：TLE。快速幂求逆元，误将外层计算语句加入了if条件之内。
//错误2：WA，输出0。可能是类型错误、也可能是全局变量未初始化。填阶乘表起始点从2开始的，断裂。
const int N = 100000 + 10;
const int model = 1e9 + 7;

int numberParameter;

void declaration(){
    scanf("%d", &numberParameter);
}

long long factorial[2 * N];
long long factorialInverse[2 * N];
//以下函数中model是一个定值，都是1e9 + 7
long long inverseNumber(long long numberToTransform, int model){
    int exponent = model - 2;
    long long power = 1;
    long long multiplyFactor = numberToTransform;
    while(exponent != ZERO){
        if((exponent & 1) != ZERO){
            power = power * multiplyFactor % model;
        }
            exponent >>= 1;
            multiplyFactor = multiplyFactor * multiplyFactor % model;
    }
    //printf("算得逆元为%lld.\n", power);
    return power;
}

long long factorialCalculation(){
    factorial[0] = 1;
    factorialInverse[0] = 1;
    for (int factorialNumber = 1; factorialNumber <= 2 * numberParameter; factorialNumber ++){
        factorial[factorialNumber] = factorial[factorialNumber - 1] * factorialNumber % model;
        factorialInverse[factorialNumber] = factorialInverse[factorialNumber - 1] * inverseNumber(factorialNumber, model) % model;
    }
    //printf("2N阶乘为:%lld\n", factorial[numberParameter]);
}

long long result = 1;

void resultCalculation(){
    //printf("初始化result为：%lld\n", result);
    //printf("乘因子为%lld\n", factorial[2 * numberParameter]);
    result = result * factorial[2 * numberParameter] % model;
    //printf("第一步算完%lld\n", result);
    result = result * factorialInverse[numberParameter] % model * factorialInverse[numberParameter] % model;
    //printf("第二步算完%lld\n", result);
    result = result * inverseNumber(numberParameter + 1, model) % model;
    //printf("第三步算完%lld\n", result);
}

void outputResult(){
    printf("%lld", result);
}

int main(){
    declaration();
    factorialCalculation();
    resultCalculation();
    outputResult();
    return 0;
}