#include<iostream>
#include<cstdio>
#define N 10000001
#define mod 1000000007
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int n,ans,pw[N+1],fac[N+1],invfac[N+1];
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
int C(int x,int y)
{
	if (x<y) return 0;
	return 1ll*fac[x]*invfac[y]%mod*invfac[x-y]%mod;
}
int calc(int x)
{
	return 1ll*pw[x]*invfac[n<<1]%mod;
}
int calc2(int x)
{
	return 1ll*pw[x]*x%mod*MD2(invfac[n<<1]-invfac[(n<<1)+1])%mod;
}
int main()
{
	int l;
	fac[0]=1;
	for (int i=1;i<=N;++i) fac[i]=1ll*fac[i-1]*i%mod;
	invfac[N]=fast_pow(fac[N],mod-2);
	for (int i=N-1;i>=0;--i) invfac[i]=1ll*invfac[i+1]*(i+1)%mod;
	n=read();
	for (int i=0;i<=(n<<1);++i) pw[i]=fast_pow(i,n<<1);
	for (int i=0;i<=(n<<1);++i)
	{
		l=max(n-i,0);
		if (!(i&1)) Adder(ans,1ll*C(n<<1,i)*MD2(MD2(calc2((n<<1)-i)-calc2(l))-1ll*MD2(calc((n<<1)-i)-calc(l))*MD2(n-i)%mod)%mod);
		else Adder2(ans,-1ll*C(n<<1,i)*MD2(MD2(calc2((n<<1)-i)-calc2(l))-1ll*MD2(calc((n<<1)-i)-calc(l))*MD2(n-i)%mod)%mod);
	}
	printf("%lld\n",2ll*ans%mod);
	return 0;
}