#include <iostream>

const int MOD = 666013;
const int NMAX = 1000006;

using namespace std;

int N;
int fact[2*NMAX];

int pow(int x, int p)
{
    if (p == 0)
        return 1;

    long long rez = pow(x,p/2);
    rez = rez*rez % MOD;
    if (p % 2 == 1)
        rez = rez*x%MOD;

    return rez;
}

int A(int a, int b)
{
    return fact[a] * pow(fact[a-b],MOD-2) % MOD;
}


int main()
{
    cin >> N;


    fact[0] = 1;
    for (int i = 1; i <= 2*N; ++i)
    {
        fact[i] = 1LL*fact[i-1]*i % MOD;
    }

    int answer = 0;

    for (int i = 2; i <= N; ++i)
    {
        answer = (answer + A(2*N,i) - 2*A(N,i)) % MOD;
    }

    for (int i = N+1; i <= 2*N; ++i)
    {
        answer = (answer + A(2*N,i)) % MOD;
    }

    cout << answer;

    return 0;
}