#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int mod = 1e9 + 7;
int fac[10000005], inv[10000005];
int qpow(int x, int y)
{
	int ans = 1;
	while(y)
	{
		if(y & 1)
			ans = (ll)ans * x % mod;
		x = (ll)x * x % mod;
		y >>= 1;
	}
	return ans;
}

int main()
{
	int n, i, r, ans = 0, tmp;
	scanf("%d", &n);
	fac[0] = 1;
	for(i = 1; i <= 2 * n; i++)
		fac[i] = (ll)fac[i - 1] * i % mod;
	inv[2 * n] = qpow(fac[2 * n], mod - 2);
	for(i = 2 * n; i >= 1; i--)
		inv[i - 1] = (ll)inv[i] * i % mod;
	r = qpow(2 * n + 1, mod - 2);
	for(i = 0; i <= n; i++)
	{
		tmp = (ll)inv[i] * inv[2 * n - i] % mod * r % mod * qpow(n - i, 2 * n + 1) % mod;
		if(i & 1)
			tmp = mod - tmp;
		ans = (ans + tmp) % mod;
	}
	ans = (ll)ans * 2 % mod;
	printf("%d\n", ans);
	return 0;
}