#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;


ll fact[15000005];

ll extgcd(ll a,ll b,ll& x,ll& y){
	ll d=a;
	if(b!=0LL){
		d=extgcd(b,a%b,y,x);
		y-=(a/b)*x;
	}else{
		x=1;
		y=0;
	}
	return d;
}

ll mod_inverse(ll a,ll m){
	ll x,y;
	extgcd(a,m,x,y);
	return (m+x%m)%m;
}


int main(void){
	fact[0]=1;
	for(ll i=1;i<=1400000;i++){
		fact[i]=fact[i-1]*i%MOD;
	}
	int n;
	scanf("%d",&n);
	ll ans=0;
	for(int i=0;i*2<=n;i++){
		if(i==0)ans++;
		if(i==1){
			ans+=n;
		}
		if(i>=2){
			ll val=fact[n+i*2-1];
			val=val*mod_inverse(fact[n+i],MOD)%MOD;
			val=(ll)val*n%MOD;
			val=val*mod_inverse(fact[i],MOD)%MOD;
			ans=(ans+val)%MOD;
		}
	}
	printf("%d\n",ans);
	return 0;
}