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

ll n, mod = 9999991;

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

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)))%mod*inv(fact(n)))%mod*inv(n+1))%mod;
}