#include<cstdio>
#include<vector>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<map>
#include<set>
#include<queue>
#include<algorithm>

using namespace std;

int N, mod;

int calc (int N)
{
    int sum = 0, P = 1;
    for (int j=N; j>=1; j--)
    {
        P = (1LL * P * j) % mod;
        sum += P;
        if (sum >= mod)
            sum -= mod;
        if (P == 0)
            break;
    }
    return sum;
}

int main()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);

scanf ("%d", &N);
mod = 666013;

int v1 = calc (2 * N), v2 = calc (N);
v2 += v2;
if (v2 >= mod)
    v2 -= mod;

int ans = v1 - v2;
if (ans < 0)
    ans += mod;
printf ("%d\n", ans);

return 0;
}