#include <fstream>
#define ll long long
using namespace std;

ll n, mod = 9999991;

ll lgput(ll n, ll p){
    ll rs = 1;
    if (p&1) rs=rs*n%mod;
        n=n*n%mod;
        p=p>>1;
        
    return rs;
}

ll inv(ll a){
    return lgput(a,mod-2);
}

ll fact(ll n){
    ll pr = 1;
    for (ll i=2; i<=n; i++)
        pr = (pr * i) % mod;
    return pr;
}

int main() 
{
    ifstream cin("dirichlet.in");
    ofstream cout("dirichlet.out");
    cin>>n;
    cout<<fact(2*n)/(inv(fact(n))*inv(fact(n))*inv(n+1));
}