#include <iostream>
#include <fstream>
using namespace std;

ifstream f("dirichlet.in");
ofstream g("dirichlet.out");

const int MOD = 9999991;

long long power(int a, int b)
{
    long long p = 1;
    while(b > 0)
    {
        if(b & 1)
            p = 1LL * p * a % MOD;
        a = 1LL * a * a % MOD;
        b >>= 1;
    }
    return p;
}

long long catalan(int n)
{
    long long c = 1, f = 1;
    for(int i = 2; i <= n; ++i)
    {
        c = 1LL * c * (n + i) % MOD;
        f = 1LL * f * i % MOD;
    }
    c = 1LL * c * power(f, MOD - 2) % MOD;
    return c;
}

int main()
{
    int n;
    f >> n;
    g << catalan(n);
    f.close();
    g.close();
    return 0;
}