#include <fstream>
using namespace std;
ifstream f("dirichlet.in");
ofstream g("dirichlet.out");
const long long MOD = 9999991;
long long fact[1000001];
long long putere(long long a, long long b)
{
    long long r = 1;
    while(b)
    {
        if(b & 1)
            r = r * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return r;
}
int main()
{
    int N;
    f >> N;
    fact[0] = 1;
    for(int i = 1; i <= 2 * N; i++)
        fact[i] = fact[i - 1] * i % MOD;
    long long comb = fact[2 * N];
    comb = comb * putere(fact[N], MOD - 2) % MOD;
    comb = comb * putere(fact[N], MOD - 2) % MOD;
    long long ans = comb * putere(N + 1, MOD - 2) % MOD;
    g << ans;
    return 0;
}