#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=200010;
const int INF=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+7;
int inv[N];
int ijc[N];
int jc[N];
void init(int n){
	inv[1]=1;
	jc[0]=1;
	ijc[0]=1;
	for(int i=2;i<=n;i++)inv[i]=(mod-mod/i)*inv[mod%i]%mod;
	for(int i=1;i<=n;i++){
		jc[i]=jc[i-1]*i%mod;
		ijc[i]=ijc[i-1]*inv[i]%mod;
	}
	return;
}
int C(int n,int m){
	if(n<m)return 0;
	int fz=jc[n];
	int fm=ijc[m]*ijc[n-m]%mod;
	return fz*fm%mod;
}
int n;
int ans;
int dp[N];
signed main(){
	// ios::sync_with_stdio(0);
	// cin.tie(0);
	// cout.tie(0);
	// freopen("walk.in","r",stdin);
	// freopen("walk.out","w",stdout);
	init(N-10);
	cin>>n;
	for(int i=n;i<=2*n;i+=2){
		dp[i]=C(i,n+(i-n)/2);
		for(int j=n;j<=i-2;j++){
			dp[i]-=dp[j]*C(i-j,(i-j)/2)%mod;
			dp[i]%=mod;
		}
		dp[i]=(dp[i]%mod+mod)%mod;
		// cerr<<dp[i]<<"\n";
		ans=(ans+dp[i])%mod;
	}
	cout<<ans<<"\n";
	return 0;
}
/*
dp[i]=C(i,n)-dp[n]*C(i-n,(i-n)/2)-dp[n+2]*C(i-(n+2),i-(n+2)/2)-...
*/