#include<cstdio>
#include<fstream>
#include<algorithm>
using namespace std;
int mod,n;
int pow(int a,int b)
{
    int i,p=1;
    for(i=0;(1<<i)<=b;i++)
    {
        if(b&(1<<i)) p=(1LL*p*a)%mod;
        a=(1LL*a*a)%mod;
    }
    return p;
}
int factorial(int n)
{
    if(n==0) return 1;
    return (1LL*n*factorial(n-1))%mod;
}
int main()
{
freopen("dirichlet.in","r",stdin);
freopen("dirichlet.out","w",stdout);
scanf("%d",&n);
mod=9999991;
printf("%d\n",( 1LL* ((1LL*factorial(2*n)*pow(factorial(n),mod-2))%mod)* pow(factorial(n+1),mod-2) )%mod);
return 0;
}