#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
const int N=5e5+7;
const int mod=1e9+7;
int inv[N],fac[N];
inline int ksm(int a,int b){
	int res=1;
	while(b){
		if(b&1)res=res*a%mod;
		a=a*a%mod;b>>=1;
	}
	return res;
} 
inline int C(int n,int m){
	if(n<m||n<0||m<0)return 0ll;
	return fac[n]*inv[n-m]%mod*inv[m]%mod;
}
signed main(){
	fac[0]=1;
	for(int i=1;i<N;i++)fac[i]=fac[i-1]*i%mod;
	inv[N-1]=ksm(fac[N-1],mod-2);
	for(int i=N-2;i>=0;i--)inv[i]=inv[i+1]*(i+1)%mod;
	inv[0]=inv[1]=1;
	int n;cin>>n;
	int res=0;
	for(int i=n;i<=2*n;i+=2){
		int tmp=((C(i-1,i-(i-n)/2-1)-C(i-1,(i-n)/2-1))%mod+mod)%mod;
		(res+=tmp)%=mod;
	}
	cout<<(res%mod+mod)%mod;
}