#include <bits/stdc++.h>
#define MOD 9999991
#define ll long long
using namespace std;
ifstream f("dirichlet.in");
ofstream g("dirichlet.out");
ll put(ll a, ll n)
{
    ll r=1;
    while(n)
    {
        if(n&1)
            r=(r*a)%MOD;
        n>>=1;
        a=(a*a)%MOD;
    }
    return r;
}
ll fct(int n)
{
    ll p;
    for(p=1;n;n--)
    {
        p=(p*n)%MOD;
    }
    return p;
}
ll fct2(int n)
{
    ll p;
    int lim=(n>>1);
    for(p=1;n>lim;n--)
    {
        p=(p*n)%MOD;
    }
    return p;
}
int main()
{
    int n;
    f>>n;
    ll p1,p2;
    p1=fct(n);
    p1=(p1*(n+1))%MOD;
    p2=fct2(2*n);
    p1=put(p1,MOD-2);
    g<<(p1*p2)%MOD;

    return 0;
}