#include<bits/stdc++.h>
using namespace std;

const int mod=9999991;



inline int fastexp(long long a,long long b)
{
    long long res=1LL;
    while(b)
    {
        if(b&1)
        {
            res=(res*a)%mod;
            b--;
        }
            else
        {
            a=(a*a)%mod;
            b>>=1;
        }
    }

    return res;
}



int n;

int main()
{
    freopen("dirichlet.in","r",stdin);
    freopen("dirichlet.out","w",stdout);

    scanf("%d",&n);

    long long sol=1LL;

    for(long long i=n+2;i<=2*n;i++)
        sol=(sol*i)%mod;

    for(long long i=1;i<=n;i++)
        sol=(sol*fastexp(i,mod-2LL))%mod;





    printf("%lld\n",sol);
    return 0;
}