#include <fstream>
#define ll long long
using namespace std;
 
ll n, mod = 9999991, primu;
 
ll lgput (ll n, ll p)
{
    ll aux = 1;
    while(p) {
        if(p % 2 == 1) aux = (aux * n) % mod;
        n = (n * n) % mod;
        p /= 2;
    }
    return aux;
}
 
int main() 
{
    //NU STITI KINE VINDE SAPA IEFTINA SI BUNA PENTRU PRASIT?
    
    ifstream cin("dirichlet.in");
    ofstream cout("dirichlet.out");
    cin>>n;
    ll pr = 1, doi = 1;
    for (ll i=1; i<=n; i++)
        pr = (pr * i) % mod,
        doi = ((doi%mod) * (i%mod) * (n+i)) % mod;

    primu = lgput(((pr*pr)%mod*(n+1))%mod,mod-2);
    
        
    cout<<(primu*doi)%mod;
}