# include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7,_2=(mod+1)/2;
typedef long long ll;
int n,prime[2000010],tot;
bool nopri[20000010];
ll pw[20000010],fac[10000010],inv[10000010],finv[10000010];
ll C(int n,int m){return fac[n]*finv[n-m]%mod*finv[m]%mod;}
ll power(ll a,int b)
{
	ll ans=1;
	for(;b;b>>=1,a=a*a%mod)
		if(b&1) ans=ans*a%mod;
	return ans;
}
ll calc(int m,int a)// \int_0^m x^{2*n-1}(x-a) dx
{
	return (m*inv[2*n+1]+(mod-a)*inv[2*n])%mod*pw[m]%mod;
}
int main()
{
	int ans=0;
	cin>>n;
	fac[0]=fac[1]=inv[0]=inv[1]=finv[0]=finv[1]=1;
	for(int i=2;i<=2*n+1;i++) fac[i]=fac[i-1]*i%mod;
	for(int i=2;i<=2*n+1;i++) inv[i]=(mod-mod/i)*inv[mod%i]%mod;
	for(int i=2;i<=2*n+1;i++) finv[i]=finv[i-1]*inv[i]%mod;
	nopri[0]=nopri[1]=1;pw[1]=1;
	for(int i=2;i<=4*n;i++)
	{
		if(!nopri[i]) prime[++tot]=i,pw[i]=power(i,2*n);
		for(int j=1;j<=tot && i*prime[j]<=4*n;j++)
		{
			nopri[i*prime[j]]=1;
			pw[i*prime[j]]=pw[i]*pw[prime[j]]%mod;
			if(i%prime[j]==0) break;
		}
	}
	ll w=finv[2*n-1]*power(_2,2*n)%mod;
	for(int i=0;i<=2*n;i++)
	{
		ll w1=(i&1?mod-C(2*n,i):C(2*n,i))*w%mod;
		if(i<=n) ans=(ans+w1*(mod-calc(2*n-2*i,2*n-2*i)))%mod;
		ans=(ans+w1*(calc(4*n-2*i,2*n-2*i)-calc(max(0,2*n-2*i),2*n-2*i)+mod))%mod;
	}
	cout<<(ll)ans*_2%mod<<endl;
	return 0;
}