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

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

const int MOD = 9999991;


long long putere(long long x, long long m)
{
    long long val = 1;
    while(m > 0)
    {
        if(m & 1)
            val = 1LL * val * x % MOD;
        x = 1LL * x * x % MOD;
        m >>= 1;
    }
    return val;
}

int main()
{
    int n;
    f >> n;
    long long A = 1, B = 1;
    for (int i = 2; i <= n; i++) {
        A = A * (n+i) % MOD;
        B = B * i % MOD;
    }
    g << A * putere(B,MOD-2) % MOD;
    f.close();
    g.close();
    return 0;
}