#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <fstream>
#include <unordered_map>
#define m 666013
using namespace std;
ifstream f("dirichlet.in");
ofstream g("dirichlet.out");
int n;
long long putere(long long x,long long n)
{
    if(n==0)
        return 1;
    if(n==1)
        return x%m;
    long long a=putere(x,n/2);
    a=(a*a)%m;
    if(n%2==1)
        a=(a*x)%m;
    return a;
}
long long raspuns(int n)
{
    long long res=1;
    long long fact=1;
    for(int i=1;i<=n;i++)
        fact=(fact*i)%m;
    for(int i=n+2;i<=2*n;i++)
        res=(res*i)%m;
    return res*(putere(fact,m-2))%m;
}
int main()
{
    f>>n;
    g<<raspuns(n);
    return 0;
}