#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
mt19937 fxk(time(0));
inline int rnd(){return fxk()%mod;}
inline void fmod(int &x)
{
    if(x>=mod)x-=mod;
    return ;
}
inline int qpow(long long x,int y)
{
    long long cx=1;
    while(y)
    {
        (y&1)&&((cx*=x)%=mod);
        (x*=x)%=mod;
        y>>=1;
    }
    return cx;
}
inline int qread()
{
    int a=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch)){(a*=10)+=(ch^48);ch=getchar();}
    return a*f;
}
int n,jc[10000010],fac[10000010],ans,inv;
inline int C(int x,int y){return 1ll*jc[x]*fac[y]%mod*fac[x-y]%mod;}
int main()
{
    n=qread();
    jc[0]=1;
    for(int i=1;i<=(n<<1);++i)jc[i]=1ll*jc[i-1]*i%mod;
    fac[n<<1]=qpow(jc[n<<1],mod-2);
    for(int i=n<<1;i;--i)fac[i-1]=1ll*fac[i]*i%mod;
    inv=qpow(n<<1|1,mod-2);
    for(int i=0;i<n;++i)
    {
        if(i&1)ans=(1ll*ans+mod-1ll*C(n<<1,i)*qpow(n-i,n<<1|1)%mod*inv%mod)%mod;
        else ans=(1ll*ans+1ll*C(n<<1,i)*qpow(n-i,n<<1|1)%mod*inv)%mod;
    }
    ans=1ll*ans*fac[n<<1]*2%mod;
    printf("%d\n",ans);
    return 0;
}