#include <bits/stdc++.h>

using namespace std;

#define int long long

#define file(x,y) freopen(x,"r",stdin),freopen(y,"w",stdout);
#define tup tuple<int,int,int>
#define pii pair<int,int>
#define bit(x) bitset<x>
#define pb emplace_back
#define i12 __int128_t
#define mt make_tuple
#define mp make_pair

const int      maxn=1e6+10;
const int      mod=1e9+7;

int frac[maxn],invf[maxn];
int n;

int power(int a,int b,int p) { int tar=1ll; for(; b; b>>=1,a=1ll*a*a%p) if(b&1) tar=1ll*tar*a%p; return tar; }
int C(int n,int m) { return frac[n]*invf[m]%mod*invf[n-m]%mod; }

int calc(int x)
{
    int left=x-n;
    if(left&1) return 0; left>>=1;
    int right=x-1-left;
    return C(left+right,right)-C(left+right,left-1);
}

void work()
{
    /* Code */
    cin>>n; int tar=0;
    for(int i=n; i<=2*n; i++) (tar+=calc(i))%=mod;
    cout<<(tar%mod+mod)%mod<<'\n';
    return;
}

signed main()
{
    // file(".in",".out");
    ios::sync_with_stdio(false); 
    cin.tie(0);
    int t,stTime=clock();
    t=1;
    frac[0]=1; for(int i=1; i<maxn; i++) frac[i]=frac[i-1]*i%mod;
    invf[maxn-1]=power(frac[maxn-1],mod-2,mod);
    for(int i=maxn-2; ~i; i--) invf[i]=invf[i+1]*(i+1)%mod;
    while(t--) work();
    // cerr<<"Time : "<<(double)(clock()-stTime)/CLOCKS_PER_SEC<<'\n';
    return 0;
} // Cellinia Texas.