#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 1000000007
#define sz(x) (int)((x).size())
#define int ll
#define N 10000005
using namespace std;
int n,fac[N],inv[N];
inline ll quickPower(ll x,ll y)
{
	ll res=1;
	while (y)
	{
		if (y&1) res=res*x%mod;
		x=x*x%mod;
		y>>=1;
	}
	return res;
}
inline int C(int x,int y)
{
	if (x<y||y<0) return 0;
	return fac[x]*inv[y]%mod*inv[x-y]%mod;
}
void BellaKira()
{
	cin>>n;
	int ans=0;
	for (int i=0;i<=n;i++)
	{
		if (i%2==0)
			ans=(ans+2*inv[n+n+1]%mod*quickPower(n-i,n+n+1)%mod*C(n+n,i)%mod)%mod;
		else 
			ans=(ans-2*inv[n+n+1]%mod*quickPower(n-i,n+n+1)%mod*C(n+n,i)%mod+mod)%mod;
	}
	cout<<ans<<'\n';
}
signed main()
{
	fac[0]=1;
	for (int i=1;i<N;i++) fac[i]=fac[i-1]*i%mod;
	inv[N-1]=quickPower(fac[N-1],mod-2);
	for (int i=N-1;i>=1;i--) inv[i-1]=inv[i]*i%mod;
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}