#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=4e5+5;
const int mod=1e9+7;
int n;
ll jc[N],ny[N];
ll ksm(ll x,int y=mod-2){
    ll an=1;
    while(y){
        if(y&1)an=an*x%mod;
        x=x*x%mod;
        y>>=1;
    }
    return an;
}
ll C(int x,int y){
    if(x<y)return 0;
    if(y<0)return 0;
    return jc[x]*ny[y]%mod*ny[x-y]%mod;
}
ll ans;
int main(){
    scanf("%d",&n);
    jc[0]=1;
    for(int i=1;i<=(n<<1);++i){
        jc[i]=jc[i-1]*i%mod;
    }
    ny[n<<1]=ksm(jc[n<<1]);
    for(int i=(n<<1);i;--i)ny[i-1]=ny[i]*i%mod;
    for(int i=n-1;i<=(2*n-1);i+=2){
        int cn=n-1+(i-(n-1))/2;
        ans=(ans+C(i,cn)+mod-C(i,cn+1))%mod;
    }
    printf("%lld\n",ans);
    return 0;
}