#include <iostream>
#include <fstream>
using namespace std;
ifstream f ( "dirichlet.in" );
ofstream g ( "dirichlet.out" );
const int MOD = 9999991;
long long pow ( long long a, int b )
{
    long long p = 1;

    while ( b )
    {
        if ( b & 1 )
            p = p * a % MOD;

        b >>= 1;
        a = a * a % MOD;
    }

    return p;
}
int main()
{
    int N;
    f >> N;
    long long  s = 1, j = 1;

    for ( int i = 2; i <= N; i++ )
    {
        s = s * ( N + i ) % MOD;
        j = j * i % MOD;
    }

    g << s*pow ( j, MOD - 2 ) % MOD;
    return 0;
}