#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll =  long long ;
using P = pair<int,int> ;
const int INF = 1e9;
const int MOD = 1000000007;


long long modpow(long long a, long long b){
        bitset<40> bit(b);
        string s = bit.to_string();
        long long ret = 1;
        for (int i = 0;i< s.length(); ++i){
                ret = (ret * ret) % MOD;
                if(s[i]-'0') ret = (ret * a) % MOD;
        }
        return ret;
}

long long inverse(long long x){
    return modpow(x,MOD-2);
}

int main(){
    int n;
    cin >> n;
    ll ans = 1;
    for(int i=1;i<=2*n;i++) ans = (ans * i)%MOD;
    ans = (ans * inverse(modpow(2,n)))%MOD;
    cout << ans << endl;
    return 0;
}