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

ll n, mod = 9999991, primu, doilea;

ll lgput (ll n, ll p)
{
    ll aux = 1;
    while(p) {
        if(p % 2 == 1) aux = (aux * n) % mod;
        n = (n * n) % mod;
        p /= 2;
    }
    return aux;
}

int main() 
{
    //Nu am idee daca o sa intre sau nu, dar in orice caz, acesta ii ultimyl submit pentru problema asta! ma multumesc si cu 96!!!!
    //coded in Drokea city, 20/06/2020 - 10:59 PM
    
    ifstream cin("dirichlet.in");
    ofstream cout("dirichlet.out");
    cin>>n;
    ll pr = 1;
    for (ll i=2; i<=n; i++)
        pr = (pr * i) % mod;
    
    primu = lgput(((pr*pr)%mod*(n+1))%mod,mod-2);
    
    for (ll i=n+1; i<=2*n; i++)
        pr = (pr * i) % mod;
        
    cout<<(pr*primu)%mod;
}