#include "bits/stdc++.h"
#include <cassert>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
using pd = pair<double, double>;
using pld = pair<ld, ld>;
const int MAX_N = 1e6, M = 1e7 - 9;
ll mod_inverse[MAX_N + 1];


int main()
{
    ifstream cin("dirichlet.in");
    ofstream cout("dirichlet.out");

    int N;
    cin >> N;

    mod_inverse[1] = 1;
    for (int i = 2; i <= N; ++i)
    {
        mod_inverse[i] = ((M - M / i) * mod_inverse[M % i]) % M;
        /*if (i <= 5)
        {
            cerr << "MODINVERSE{" << i << "]: " << mod_inverse[i] << endl;
        }*/
    }

    ll res{1};
    for (int K = 2; K <= N; ++K)
    {
        res = (res * (((N + K) * mod_inverse[K]) % M)) % M;
    }

    cout << res;
}