#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll MOD = 1e9 + 7;

ll modpow(ll x, ll n) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % MOD;
		x = x * x % MOD;
		n >>= 1;
	}
	return res;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll n;
	cin >> n;
	ll ans = 1;
	for (ll i = 2; i <= 2 * n; i++) ans = ans * i % MOD;
	(ans *= modpow(modpow(2, n), MOD - 2)) %= MOD;
	cout << ans << endl;
	return 0;
}