#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
ll ksm(ll a,ll b)
{
ll res = 1;
for(;b;b>>=1,a=a*a%mod) if(b & 1) res = res * a % mod;
return res;
}
ll C(ll a,ll b)
{
b = min(a-b,b);
ll ansL = 1,ansR = 1;
for(int i = 1;i <= b; ++i)
{
ansL = ansL * (a-i+1) % mod;
ansR = ansR * i % mod;
}
ll ans = ansL * ksm(ansR,mod-2) % mod;
return ans;
}
ll slove(ll n)
{
return (C(2*n,n)-C(2*n,n-1) + mod) % mod;
}
int main()
{
ll a;
scanf("%lld",&a);
printf("%lld\n",slove(a));
return 0;
}