#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<atcoder/modint>
using mint = atcoder::modint1000000007;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll n;
    cin>>n;
    int m = 2 * n;
    vector<mint> fac(m+1,1);
    for(int i = 1;i<=m;i++) fac[i] = fac[i-1] * i;
    vector<mint> ifac(m+1,1);
    ifac[m] = fac[m].inv();
    for(int i = m-1;i>=0;i--) ifac[i] = ifac[i+1] * (i+1);
    mint ans = 1;
    for(int i = 0;i<n;i++){
        ans *= fac[m] * ifac[2] * ifac[m-2];
        m-=2;
    }
    cout<<ans.val()<<endl;
}