#include <bits/stdc++.h>
using namespace std;

int my_pow(long long a, long long b, int mod) {
    long long res = 1;
    while (b > 0) {
        if (b & 1) (res *= a) %= mod;
        (a *= a) %= mod;
        b >>= 1;
    }
    return (int)res;
}

int comb(int n, int r, int mod) {
    long long N = 1;
    for (int i = 1; i <= r; i++) (N *= (n - i + 1)) %= mod;
    long long R = 1;
    for (int i = 1; i <= r; i++) (R *= i) %= mod;
    R = my_pow(R, mod - 2, mod);
    return N * R % mod;
}

int main() {

    int n;
    int mod = (int)1e9 + 7;

    cin >> n;
    long long goods = comb(2 * n, n, mod) - comb(2 * n, n - 1, mod);
    if (goods <= 0) goods += mod;
    long long people = 1;
    for (int i = 1; i <= n; i++) (people *= i) %= mod;
    (people *= people) %= mod;
    cout << goods * people % mod << endl;
    
    return 0;
}