#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string.h>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>
#include <sstream>

using namespace std;

#define ll long long int
#define pii pair<int,int>

const ll mod = 1000000007;

long long qpow(long long a, long long b)
{
    long long ret=1;
    while(b)
    {
        if(b&1)ret=(ret*a)%mod;
        b>>=1;
        a=(a*a)%mod;
    }
    return ret;
}
int main()
{
    ll n;
    cin >> n;
    ll sum = 1;
    for(ll i = 2 * n; i >= 1;i--)
    {
        sum *= i;
        sum %= mod;
    }
    ll div = qpow(2, mod-2);
    for(int i = 0;i < n;i++)
    {
        sum *= div;
        sum %= mod;
    }
    cout << sum << endl;
}