# include <algorithm>
#include <cstdio>
# define NR 105
#define NMAX 10000000
#define MOD 666013

using namespace std;

int k,n;
long long a[105];
void euclid(int a,int b,long long &x,long long &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
    }
    else
    {
        euclid(b, a % b, x, y);
        long long aux = x;
        x = y;
        y = aux - y * (a / b);
    }
}

long long fact[NMAX];
int main ()
{
    scanf("%d",&n);
    n = n * 2;
    fact[0]=1;
    for(int i = 1; i <= n; ++i)
    {
        fact[i] = (fact[i-1] * i) % MOD;
    }
    //(n!/(n-k)!)
    long long sum = 0;
    for(int i = 2; i <= n; ++i)
    {
        if (n-i < MOD)
        {
        long long x = 0, y = 0;
         euclid(fact[n-i],MOD,x,y);
        if (x <= 0) x = MOD + x % MOD;
        long long a = (1ll * fact[n] * x) % MOD;
        sum += a;
        }
    }

    n = n/2;
    long long sum1=0;
    for(int i = 2; i <= n; ++i)
    {
         long long x = 0, y = 0;
         if(n-i <MOD)
         {
         euclid(fact[n-i],MOD,x,y);
        if (x <= 0) x = MOD + x % MOD;
        long long a = (1ll * fact[n] * x) % MOD;
        sum1 += a;
         }
    }
    sum1 = (sum1 * 2) % MOD;
    if (sum1 > sum) sum += MOD * 2;
    sum -= sum1;
    printf("%lld\n",sum%MOD);
    return 0;
}