#include <iostream>
using namespace std;

using int64 = long long;

const int64 mod = 1e9 + 7;

int64 pow_mod(int64 a, int64 b) {
    if (b == 0) return 1;
    else if (b % 2 == 0) {
        int64 c = pow_mod(a, b / 2);
        return (c * c) % mod;
    } else {
        return (a * pow_mod(a, b - 1)) % mod;
    }
}

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

    // 2N! / 2^N 
    int64 ans = 1;
    for (int n = 1; n <= 2 * N; n++) {
        (ans *= n) %= mod;
    }
    (ans *= pow_mod(pow_mod(2, N), mod - 2)) %= mod;

    cout << ans << endl;
    
    return 0;
}