// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
const int N = 1e7 + 10, MOD = 1e9 + 7;
int n, ans, fac[N], ifac[N], inv[N];
inline void binom(int x) {
	fac[0] = ifac[0] = inv[1] = 1;
	F(i, 2, x) inv[i] = (ll) (MOD - MOD / i) * inv[MOD % i] % MOD;
	F(i, 1, x) fac[i] = (ll) fac[i - 1] * i % MOD, ifac[i] = (ll) ifac[i - 1] * inv[i] % MOD;
}
inline int C(int x, int y) {return x < y || y < 0 ? 0 : (ll) fac[x] * ifac[y] % MOD * ifac[x - y] % MOD;}
inline int power(int x, int y = MOD - 2) {
	int ans = 1;
	for (; y; x = (ll) x * x % MOD, y >>= 1)
		if (y & 1) ans = (ll) ans * x % MOD;
	return ans;
}
inline void add(int &x, ll y) {x = (x + y) % MOD;}
signed main() {
	binom(N - 1);
	cin >> n;
	F(i, 0, n) {
		int w = 2ll * ifac[2 * n + 1] % MOD * power(n - i, 2 * n + 1) % MOD * C(2 * n, i) % MOD;
		if (i & 1) add(ans, MOD - w);
		else add(ans, w);
	}
	cout << ans;
	return 0;
}
/* why?
*/