#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <algorithm>

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
using namespace std;

const int INF = 0x3f3f3f3f;
const double EPS = 0.000000001;
const double PI = 3.141592653589793;
const long long LLINF = 99999999999999999LL;
const int MAX_N = 4 * 1000002;
const int MOD = 666013;
const long long MAX_VAL = 200000000;

int N;
long long ans;
long long a[2 * MAX_N], b[2 * MAX_N];

int main()
{
    cin >> N;

    a[2 * N + 1] = 1;
    for(int i = 2 * N; i >= 1; --i)
        a[i] = (a[i + 1] * i) % MOD;
    b[N + 1] = 1;
    for(int i = N; i >= 1; --i)
        b[i] = (b[i + 1] * i) % MOD;

    for(int i = 1; i <= 2 * N; ++i)
        ans = (ans + a[2 * N - i + 1]) % MOD;

    long long tmp = 0;
    for(int i = 1; i <= N; ++i)
        tmp = (tmp + b[N - i + 1]) % MOD;
    tmp = (tmp * 2) % MOD;

    ans -= tmp;
    while(ans < 0)
        ans += MOD;

    cout << ans;

    return 0;
}