#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

const int mod = 666013;

int n, N, A, B, i, sol, mlc1, mlc2;

int main()
{
//    freopen("test.in", "r", stdin);
//    freopen("test.out", "w", stdout);

    scanf("%d", &n);

    N = 2 * n;

    mlc1 = N - 1;
    mlc2 = n - 1;
    A = N % mod;
    B = 2 * n % mod;

    for(i = 2; i <= N; i++)
    {
        A = (1LL * A * mlc1) % mod;
        B = (1LL * B * mlc2) % mod;

        mlc1--;
        mlc2--;

        sol = (sol + A - B + mod) % mod;
    }

    printf("%d\n", sol);

    return 0;
}