#include<iostream>
using namespace std;
#define int long long
const int N = 4e5 + 5;
const int mod = 1e9 + 7;

int n,fac[N],inv[N];

int qpow(int a,int b)
{
	int res = 1;
	while(b)
	{
		if(b & 1) res = res * a % mod;
		a = a * a % mod; b >>= 1;
	}
	return res;
}

int c(int x,int y)
{
	if(x < 0 || y < 0 || x < y) return 0;
	return fac[x] * inv[y] % mod * inv[x-y] % mod;
}

signed main()
{
	fac[0] = 1; for(int i=1;i<N;i++) fac[i] = fac[i-1] * i % mod;
	inv[N-1] = qpow(fac[N-1],mod-2); for(int i=N-2;i>=0;i--) inv[i] = inv[i+1] * (i + 1) % mod;
	cin >> n; int ans = 0;
	for(int i=0;i<=n/2;i++) ans = (ans + c(n+2*i-1,i) + mod - c(n+2*i-1,n+i)) % mod;
	cout << ans << '\n';
	return 0;
}